./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_right_trim_pred_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_right_trim_pred_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f85fffa00ce152c2185c303de3856b218143afacade5a3da3d11c284e86ce457 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 20:58:34,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 20:58:34,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 20:58:34,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 20:58:34,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 20:58:34,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 20:58:34,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 20:58:34,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 20:58:34,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 20:58:34,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 20:58:34,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 20:58:34,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 20:58:34,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 20:58:34,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 20:58:34,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 20:58:34,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 20:58:34,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 20:58:34,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 20:58:34,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 20:58:34,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 20:58:34,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 20:58:34,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 20:58:34,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 20:58:34,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 20:58:34,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 20:58:34,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 20:58:34,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 20:58:34,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 20:58:34,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 20:58:34,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 20:58:34,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 20:58:34,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 20:58:34,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 20:58:34,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 20:58:34,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 20:58:34,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 20:58:34,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 20:58:34,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 20:58:34,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 20:58:34,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 20:58:34,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 20:58:34,109 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 20:58:34,132 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 20:58:34,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 20:58:34,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 20:58:34,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 20:58:34,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 20:58:34,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 20:58:34,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 20:58:34,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 20:58:34,134 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 20:58:34,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 20:58:34,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 20:58:34,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 20:58:34,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 20:58:34,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 20:58:34,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 20:58:34,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 20:58:34,136 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 20:58:34,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 20:58:34,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 20:58:34,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 20:58:34,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 20:58:34,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:58:34,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 20:58:34,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 20:58:34,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 20:58:34,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 20:58:34,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 20:58:34,138 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 20:58:34,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 20:58:34,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 20:58:34,138 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 20:58:34,139 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/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f85fffa00ce152c2185c303de3856b218143afacade5a3da3d11c284e86ce457 [2021-11-16 20:58:34,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 20:58:34,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 20:58:34,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 20:58:34,339 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 20:58:34,339 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 20:58:34,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_right_trim_pred_harness.i [2021-11-16 20:58:34,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9fffac2/efcd10fabfd24cd9a107d00042a04888/FLAGbf2e23ee5 [2021-11-16 20:58:35,016 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 20:58:35,016 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_right_trim_pred_harness.i [2021-11-16 20:58:35,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9fffac2/efcd10fabfd24cd9a107d00042a04888/FLAGbf2e23ee5 [2021-11-16 20:58:35,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9fffac2/efcd10fabfd24cd9a107d00042a04888 [2021-11-16 20:58:35,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 20:58:35,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 20:58:35,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 20:58:35,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 20:58:35,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 20:58:35,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:58:35" (1/1) ... [2021-11-16 20:58:35,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3d5128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:35, skipping insertion in model container [2021-11-16 20:58:35,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:58:35" (1/1) ... [2021-11-16 20:58:35,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 20:58:35,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 20:58:35,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_right_trim_pred_harness.i[4505,4518] [2021-11-16 20:58:35,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_right_trim_pred_harness.i[4565,4578] [2021-11-16 20:58:35,707 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:58:35,713 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:58:36,215 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,216 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,216 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,217 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,217 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,225 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,226 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,227 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,227 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,422 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:58:36,423 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:58:36,424 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:58:36,424 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:58:36,425 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:58:36,426 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:58:36,426 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:58:36,426 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:58:36,427 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:58:36,427 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:58:36,538 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:58:36,676 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,677 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,731 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:58:36,772 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 20:58:36,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_right_trim_pred_harness.i[4505,4518] [2021-11-16 20:58:36,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_right_trim_pred_harness.i[4565,4578] [2021-11-16 20:58:36,794 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:58:36,794 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:58:36,819 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,819 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,820 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,821 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,821 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,825 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,826 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,826 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,827 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,854 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:58:36,855 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:58:36,856 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:58:36,856 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:58:36,857 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:58:36,857 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:58:36,857 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:58:36,858 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:58:36,858 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:58:36,860 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:58:36,878 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:58:36,958 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,959 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:36,978 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:58:37,139 INFO L208 MainTranslator]: Completed translation [2021-11-16 20:58:37,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:37 WrapperNode [2021-11-16 20:58:37,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 20:58:37,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 20:58:37,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 20:58:37,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 20:58:37,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:37" (1/1) ... [2021-11-16 20:58:37,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:37" (1/1) ... [2021-11-16 20:58:37,325 INFO L137 Inliner]: procedures = 692, calls = 2622, calls flagged for inlining = 60, calls inlined = 8, statements flattened = 796 [2021-11-16 20:58:37,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 20:58:37,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 20:58:37,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 20:58:37,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 20:58:37,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:37" (1/1) ... [2021-11-16 20:58:37,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:37" (1/1) ... [2021-11-16 20:58:37,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:37" (1/1) ... [2021-11-16 20:58:37,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:37" (1/1) ... [2021-11-16 20:58:37,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:37" (1/1) ... [2021-11-16 20:58:37,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:37" (1/1) ... [2021-11-16 20:58:37,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:37" (1/1) ... [2021-11-16 20:58:37,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 20:58:37,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 20:58:37,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 20:58:37,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 20:58:37,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:37" (1/1) ... [2021-11-16 20:58:37,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:58:37,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:37,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-16 20:58:37,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-16 20:58:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2021-11-16 20:58:37,465 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2021-11-16 20:58:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 20:58:37,466 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 20:58:37,466 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 20:58:37,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 20:58:37,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 20:58:37,467 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 20:58:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 20:58:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 20:58:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 20:58:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 20:58:37,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 20:58:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 20:58:37,468 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 20:58:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2021-11-16 20:58:37,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2021-11-16 20:58:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 20:58:37,469 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 20:58:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 20:58:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 20:58:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 20:58:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~uint8_t~0~TO~int [2021-11-16 20:58:37,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~uint8_t~0~TO~int [2021-11-16 20:58:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 20:58:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_right_trim_pred [2021-11-16 20:58:37,471 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_right_trim_pred [2021-11-16 20:58:37,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 20:58:37,688 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 20:58:37,690 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 20:58:38,841 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 20:58:38,845 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 20:58:38,846 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-16 20:58:38,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:58:38 BoogieIcfgContainer [2021-11-16 20:58:38,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 20:58:38,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 20:58:38,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 20:58:38,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 20:58:38,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:58:35" (1/3) ... [2021-11-16 20:58:38,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1de6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:58:38, skipping insertion in model container [2021-11-16 20:58:38,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:37" (2/3) ... [2021-11-16 20:58:38,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1de6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:58:38, skipping insertion in model container [2021-11-16 20:58:38,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:58:38" (3/3) ... [2021-11-16 20:58:38,853 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_right_trim_pred_harness.i [2021-11-16 20:58:38,857 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 20:58:38,857 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 20:58:38,887 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 20:58:38,891 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 20:58:38,892 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 20:58:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-11-16 20:58:38,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-16 20:58:38,909 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:38,910 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:58:38,910 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:38,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:38,914 INFO L85 PathProgramCache]: Analyzing trace with hash 990555707, now seen corresponding path program 1 times [2021-11-16 20:58:38,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:38,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759631186] [2021-11-16 20:58:38,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:38,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:58:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:58:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:58:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 20:58:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:58:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 20:58:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:58:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:58:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-16 20:58:39,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:39,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759631186] [2021-11-16 20:58:39,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759631186] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:39,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:58:39,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-16 20:58:39,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209403846] [2021-11-16 20:58:39,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:39,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-16 20:58:39,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:39,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-16 20:58:39,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 20:58:39,336 INFO L87 Difference]: Start difference. First operand has 95 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-16 20:58:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:39,362 INFO L93 Difference]: Finished difference Result 186 states and 253 transitions. [2021-11-16 20:58:39,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-16 20:58:39,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2021-11-16 20:58:39,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:39,369 INFO L225 Difference]: With dead ends: 186 [2021-11-16 20:58:39,370 INFO L226 Difference]: Without dead ends: 86 [2021-11-16 20:58:39,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 20:58:39,375 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:39,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:58:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-11-16 20:58:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-11-16 20:58:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 57 states have internal predecessors, (66), 22 states have call successors, (22), 8 states have call predecessors, (22), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-11-16 20:58:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2021-11-16 20:58:39,426 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 61 [2021-11-16 20:58:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:39,427 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2021-11-16 20:58:39,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-16 20:58:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2021-11-16 20:58:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-16 20:58:39,429 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:39,429 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:58:39,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 20:58:39,430 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:39,430 INFO L85 PathProgramCache]: Analyzing trace with hash -89389740, now seen corresponding path program 1 times [2021-11-16 20:58:39,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:39,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993732805] [2021-11-16 20:58:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:39,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:58:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:58:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:58:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 20:58:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:58:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 20:58:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:58:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:58:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-16 20:58:39,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:39,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993732805] [2021-11-16 20:58:39,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993732805] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:39,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564248073] [2021-11-16 20:58:39,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:39,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:39,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:39,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:58:39,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-16 20:58:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:40,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 2454 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 20:58:40,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-16 20:58:40,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:58:40,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564248073] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:40,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:58:40,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2021-11-16 20:58:40,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414669466] [2021-11-16 20:58:40,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:40,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:58:40,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:40,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:58:40,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:58:40,335 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-16 20:58:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:40,429 INFO L93 Difference]: Finished difference Result 155 states and 200 transitions. [2021-11-16 20:58:40,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:58:40,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2021-11-16 20:58:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:40,432 INFO L225 Difference]: With dead ends: 155 [2021-11-16 20:58:40,432 INFO L226 Difference]: Without dead ends: 89 [2021-11-16 20:58:40,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:58:40,434 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 124 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:40,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 231 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:58:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-16 20:58:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-11-16 20:58:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 60 states have internal predecessors, (68), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2021-11-16 20:58:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2021-11-16 20:58:40,443 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 63 [2021-11-16 20:58:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:40,444 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2021-11-16 20:58:40,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-16 20:58:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2021-11-16 20:58:40,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-16 20:58:40,445 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:40,446 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-11-16 20:58:40,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-16 20:58:40,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:40,653 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:40,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1896344881, now seen corresponding path program 1 times [2021-11-16 20:58:40,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:40,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846697233] [2021-11-16 20:58:40,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:40,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:40,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:58:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:40,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:58:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:40,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:58:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:40,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:58:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:40,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:58:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:40,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:58:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:58:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 20:58:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-16 20:58:40,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:40,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846697233] [2021-11-16 20:58:40,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846697233] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:40,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270755376] [2021-11-16 20:58:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:40,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:40,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:40,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:58:40,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-16 20:58:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:41,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 2459 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 20:58:41,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-16 20:58:41,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:58:41,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270755376] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:41,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:58:41,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2021-11-16 20:58:41,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127668775] [2021-11-16 20:58:41,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:41,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:58:41,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:41,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:58:41,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:58:41,441 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-16 20:58:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:41,635 INFO L93 Difference]: Finished difference Result 148 states and 189 transitions. [2021-11-16 20:58:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:58:41,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 65 [2021-11-16 20:58:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:41,636 INFO L225 Difference]: With dead ends: 148 [2021-11-16 20:58:41,637 INFO L226 Difference]: Without dead ends: 89 [2021-11-16 20:58:41,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-11-16 20:58:41,638 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 135 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:41,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 348 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:58:41,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-16 20:58:41,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-11-16 20:58:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 60 states have internal predecessors, (68), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2021-11-16 20:58:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2021-11-16 20:58:41,645 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 65 [2021-11-16 20:58:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:41,646 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2021-11-16 20:58:41,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-16 20:58:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2021-11-16 20:58:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-16 20:58:41,647 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:41,647 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:58:41,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-16 20:58:41,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-16 20:58:41,860 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1793788399, now seen corresponding path program 1 times [2021-11-16 20:58:41,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:41,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002654631] [2021-11-16 20:58:41,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:41,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:58:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:58:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:58:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:58:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:58:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-16 20:58:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-16 20:58:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:58:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-11-16 20:58:42,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:42,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002654631] [2021-11-16 20:58:42,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002654631] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:42,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:58:42,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 20:58:42,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754289518] [2021-11-16 20:58:42,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:42,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:58:42,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:42,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:58:42,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:58:42,116 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-16 20:58:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:42,171 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2021-11-16 20:58:42,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:58:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2021-11-16 20:58:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:42,174 INFO L225 Difference]: With dead ends: 101 [2021-11-16 20:58:42,174 INFO L226 Difference]: Without dead ends: 99 [2021-11-16 20:58:42,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:58:42,178 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 16 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:42,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 728 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:58:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-16 20:58:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-11-16 20:58:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 23 states have call successors, (23), 9 states have call predecessors, (23), 10 states have return successors, (29), 21 states have call predecessors, (29), 21 states have call successors, (29) [2021-11-16 20:58:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2021-11-16 20:58:42,198 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 69 [2021-11-16 20:58:42,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:42,200 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2021-11-16 20:58:42,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-16 20:58:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2021-11-16 20:58:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-16 20:58:42,204 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:42,204 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:58:42,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-16 20:58:42,205 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:42,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1240513463, now seen corresponding path program 1 times [2021-11-16 20:58:42,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:42,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676508188] [2021-11-16 20:58:42,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:42,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:58:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:58:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:58:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:58:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:58:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-16 20:58:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-16 20:58:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:58:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-16 20:58:42,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:42,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676508188] [2021-11-16 20:58:42,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676508188] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:42,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153673779] [2021-11-16 20:58:42,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:42,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:42,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:42,631 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:58:42,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-16 20:58:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 2481 conjuncts, 47 conjunts are in the unsatisfiable core [2021-11-16 20:58:42,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:43,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-16 20:58:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-16 20:58:43,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:58:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-16 20:58:44,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153673779] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 20:58:44,238 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 20:58:44,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 11] total 25 [2021-11-16 20:58:44,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337660712] [2021-11-16 20:58:44,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 20:58:44,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-16 20:58:44,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:44,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-16 20:58:44,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-11-16 20:58:44,239 INFO L87 Difference]: Start difference. First operand 98 states and 126 transitions. Second operand has 25 states, 25 states have (on average 3.56) internal successors, (89), 23 states have internal predecessors, (89), 8 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) [2021-11-16 20:58:45,608 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:58:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:47,767 INFO L93 Difference]: Finished difference Result 249 states and 342 transitions. [2021-11-16 20:58:47,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-16 20:58:47,768 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 23 states have internal predecessors, (89), 8 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) Word has length 73 [2021-11-16 20:58:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:47,771 INFO L225 Difference]: With dead ends: 249 [2021-11-16 20:58:47,771 INFO L226 Difference]: Without dead ends: 168 [2021-11-16 20:58:47,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 139 SyntacticMatches, 13 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2021-11-16 20:58:47,772 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 122 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:47,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 1090 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1024 Invalid, 0 Unknown, 230 Unchecked, 3.2s Time] [2021-11-16 20:58:47,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-11-16 20:58:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 136. [2021-11-16 20:58:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 90 states have (on average 1.1555555555555554) internal successors, (104), 92 states have internal predecessors, (104), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (39), 30 states have call predecessors, (39), 31 states have call successors, (39) [2021-11-16 20:58:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 176 transitions. [2021-11-16 20:58:47,784 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 176 transitions. Word has length 73 [2021-11-16 20:58:47,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:47,785 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 176 transitions. [2021-11-16 20:58:47,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 23 states have internal predecessors, (89), 8 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) [2021-11-16 20:58:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 176 transitions. [2021-11-16 20:58:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-16 20:58:47,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:47,786 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1] [2021-11-16 20:58:47,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-16 20:58:48,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:48,007 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:48,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:48,008 INFO L85 PathProgramCache]: Analyzing trace with hash 754747503, now seen corresponding path program 1 times [2021-11-16 20:58:48,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:48,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281123485] [2021-11-16 20:58:48,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:48,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:58:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:58:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:58:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-16 20:58:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 20:58:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:58:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-16 20:58:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 20:58:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-16 20:58:48,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:48,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281123485] [2021-11-16 20:58:48,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281123485] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:48,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:58:48,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-16 20:58:48,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596564001] [2021-11-16 20:58:48,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:48,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-16 20:58:48,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:48,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-16 20:58:48,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 20:58:48,148 INFO L87 Difference]: Start difference. First operand 136 states and 176 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-16 20:58:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:48,158 INFO L93 Difference]: Finished difference Result 198 states and 258 transitions. [2021-11-16 20:58:48,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-16 20:58:48,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2021-11-16 20:58:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:48,160 INFO L225 Difference]: With dead ends: 198 [2021-11-16 20:58:48,160 INFO L226 Difference]: Without dead ends: 138 [2021-11-16 20:58:48,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 20:58:48,161 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:48,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:58:48,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-11-16 20:58:48,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-11-16 20:58:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 92 states have (on average 1.141304347826087) internal successors, (105), 94 states have internal predecessors, (105), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (39), 30 states have call predecessors, (39), 31 states have call successors, (39) [2021-11-16 20:58:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 177 transitions. [2021-11-16 20:58:48,170 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 177 transitions. Word has length 80 [2021-11-16 20:58:48,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:48,171 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 177 transitions. [2021-11-16 20:58:48,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-16 20:58:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 177 transitions. [2021-11-16 20:58:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-16 20:58:48,172 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:48,172 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:58:48,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-16 20:58:48,172 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:48,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:48,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1625051706, now seen corresponding path program 1 times [2021-11-16 20:58:48,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:48,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013081166] [2021-11-16 20:58:48,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:48,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:58:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:58:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:58:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:58:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:58:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-16 20:58:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-16 20:58:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:58:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:58:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:58:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-11-16 20:58:48,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:48,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013081166] [2021-11-16 20:58:48,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013081166] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:48,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:58:48,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 20:58:48,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634358672] [2021-11-16 20:58:48,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:48,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:58:48,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:48,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:58:48,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:58:48,333 INFO L87 Difference]: Start difference. First operand 138 states and 177 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-16 20:58:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:48,368 INFO L93 Difference]: Finished difference Result 180 states and 229 transitions. [2021-11-16 20:58:48,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:58:48,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 81 [2021-11-16 20:58:48,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:48,372 INFO L225 Difference]: With dead ends: 180 [2021-11-16 20:58:48,372 INFO L226 Difference]: Without dead ends: 138 [2021-11-16 20:58:48,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:58:48,373 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 18 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:48,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 284 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:58:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-11-16 20:58:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-11-16 20:58:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 92 states have (on average 1.141304347826087) internal successors, (105), 94 states have internal predecessors, (105), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (38), 30 states have call predecessors, (38), 31 states have call successors, (38) [2021-11-16 20:58:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 176 transitions. [2021-11-16 20:58:48,387 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 176 transitions. Word has length 81 [2021-11-16 20:58:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:48,389 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 176 transitions. [2021-11-16 20:58:48,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-16 20:58:48,389 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 176 transitions. [2021-11-16 20:58:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-16 20:58:48,390 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:48,390 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:58:48,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-16 20:58:48,391 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2069482329, now seen corresponding path program 1 times [2021-11-16 20:58:48,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:48,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960734622] [2021-11-16 20:58:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:48,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:58:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:58:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:58:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-16 20:58:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 20:58:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:58:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 20:58:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:58:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-16 20:58:48,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:48,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960734622] [2021-11-16 20:58:48,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960734622] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:48,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144733222] [2021-11-16 20:58:48,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:48,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:48,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:48,640 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:58:48,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-16 20:58:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:48,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 2505 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-16 20:58:48,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:49,156 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-16 20:58:49,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:58:49,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144733222] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:49,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:58:49,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2021-11-16 20:58:49,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676962090] [2021-11-16 20:58:49,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:49,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:58:49,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:49,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:58:49,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:58:49,158 INFO L87 Difference]: Start difference. First operand 138 states and 176 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-16 20:58:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:49,247 INFO L93 Difference]: Finished difference Result 235 states and 306 transitions. [2021-11-16 20:58:49,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:58:49,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2021-11-16 20:58:49,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:49,249 INFO L225 Difference]: With dead ends: 235 [2021-11-16 20:58:49,249 INFO L226 Difference]: Without dead ends: 143 [2021-11-16 20:58:49,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:58:49,250 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 12 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:49,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 799 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:58:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-16 20:58:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-11-16 20:58:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 99 states have internal predecessors, (109), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (43), 30 states have call predecessors, (43), 31 states have call successors, (43) [2021-11-16 20:58:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 185 transitions. [2021-11-16 20:58:49,266 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 185 transitions. Word has length 81 [2021-11-16 20:58:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:49,267 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 185 transitions. [2021-11-16 20:58:49,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-16 20:58:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 185 transitions. [2021-11-16 20:58:49,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-16 20:58:49,269 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:49,269 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-11-16 20:58:49,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-16 20:58:49,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:49,488 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:49,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:49,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1271029248, now seen corresponding path program 1 times [2021-11-16 20:58:49,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:49,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671310442] [2021-11-16 20:58:49,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:49,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:58:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:58:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:58:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 20:58:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:58:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-16 20:58:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 20:58:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 20:58:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-16 20:58:49,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:49,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671310442] [2021-11-16 20:58:49,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671310442] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:49,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885757501] [2021-11-16 20:58:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:49,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:49,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:49,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:58:49,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-16 20:58:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:50,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 2515 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-16 20:58:50,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-16 20:58:50,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:58:50,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885757501] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:50,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:58:50,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2021-11-16 20:58:50,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821661432] [2021-11-16 20:58:50,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:50,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:58:50,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:50,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:58:50,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:58:50,199 INFO L87 Difference]: Start difference. First operand 143 states and 185 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-16 20:58:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:50,283 INFO L93 Difference]: Finished difference Result 217 states and 279 transitions. [2021-11-16 20:58:50,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:58:50,283 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2021-11-16 20:58:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:50,284 INFO L225 Difference]: With dead ends: 217 [2021-11-16 20:58:50,285 INFO L226 Difference]: Without dead ends: 143 [2021-11-16 20:58:50,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:58:50,286 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 12 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:50,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 792 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:58:50,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-16 20:58:50,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-11-16 20:58:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 99 states have internal predecessors, (109), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (42), 30 states have call predecessors, (42), 31 states have call successors, (42) [2021-11-16 20:58:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 184 transitions. [2021-11-16 20:58:50,293 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 184 transitions. Word has length 83 [2021-11-16 20:58:50,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:50,294 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 184 transitions. [2021-11-16 20:58:50,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-16 20:58:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 184 transitions. [2021-11-16 20:58:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-16 20:58:50,295 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:50,295 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:58:50,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-16 20:58:50,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:50,507 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:50,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:50,508 INFO L85 PathProgramCache]: Analyzing trace with hash -499743092, now seen corresponding path program 1 times [2021-11-16 20:58:50,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:50,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293662432] [2021-11-16 20:58:50,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:50,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:50,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:58:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:50,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:58:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:50,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:58:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:50,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 20:58:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:50,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:58:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:50,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-16 20:58:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:50,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 20:58:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:50,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:58:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:50,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 20:58:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-16 20:58:50,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:50,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293662432] [2021-11-16 20:58:50,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293662432] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:50,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827815547] [2021-11-16 20:58:50,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:50,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:50,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:50,897 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:58:50,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-16 20:58:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 2542 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-16 20:58:51,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:54,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2021-11-16 20:58:54,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-11-16 20:58:54,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-11-16 20:58:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-16 20:58:54,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:58:54,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827815547] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:54,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:58:54,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 21 [2021-11-16 20:58:54,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679816198] [2021-11-16 20:58:54,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:54,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 20:58:54,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:54,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 20:58:54,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2021-11-16 20:58:54,180 INFO L87 Difference]: Start difference. First operand 143 states and 184 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-16 20:58:56,090 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:58:57,747 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:58:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:58,538 INFO L93 Difference]: Finished difference Result 270 states and 363 transitions. [2021-11-16 20:58:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-16 20:58:58,538 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 88 [2021-11-16 20:58:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:58,539 INFO L225 Difference]: With dead ends: 270 [2021-11-16 20:58:58,539 INFO L226 Difference]: Without dead ends: 179 [2021-11-16 20:58:58,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-11-16 20:58:58,541 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 160 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:58,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 474 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 492 Invalid, 0 Unknown, 92 Unchecked, 4.0s Time] [2021-11-16 20:58:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-11-16 20:58:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 162. [2021-11-16 20:58:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 111 states have (on average 1.135135135135135) internal successors, (126), 115 states have internal predecessors, (126), 35 states have call successors, (35), 14 states have call predecessors, (35), 15 states have return successors, (52), 32 states have call predecessors, (52), 33 states have call successors, (52) [2021-11-16 20:58:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 213 transitions. [2021-11-16 20:58:58,549 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 213 transitions. Word has length 88 [2021-11-16 20:58:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:58,549 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 213 transitions. [2021-11-16 20:58:58,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-16 20:58:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 213 transitions. [2021-11-16 20:58:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-16 20:58:58,550 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:58,550 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:58:58,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-16 20:58:58,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:58,770 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:58,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:58,770 INFO L85 PathProgramCache]: Analyzing trace with hash 454197066, now seen corresponding path program 1 times [2021-11-16 20:58:58,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:58,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805122815] [2021-11-16 20:58:58,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:58,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:58,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:58:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:58,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:58:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:58,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:58:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:58,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 20:58:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:58,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:58:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:58,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-16 20:58:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:58,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 20:58:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:58,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:58:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:58,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 20:58:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-16 20:58:58,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:58,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805122815] [2021-11-16 20:58:58,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805122815] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:58,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938209551] [2021-11-16 20:58:58,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:58,913 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:58,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:58,914 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:58:58,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-16 20:58:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:59,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 2537 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 20:58:59,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-16 20:58:59,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:58:59,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938209551] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:59,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:58:59,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-11-16 20:58:59,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746479173] [2021-11-16 20:58:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:59,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 20:58:59,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:59,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 20:58:59,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 20:58:59,368 INFO L87 Difference]: Start difference. First operand 162 states and 213 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-16 20:58:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:59,387 INFO L93 Difference]: Finished difference Result 264 states and 354 transitions. [2021-11-16 20:58:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:58:59,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2021-11-16 20:58:59,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:59,389 INFO L225 Difference]: With dead ends: 264 [2021-11-16 20:58:59,389 INFO L226 Difference]: Without dead ends: 158 [2021-11-16 20:58:59,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:58:59,390 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 6 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:59,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 316 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:58:59,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-11-16 20:58:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2021-11-16 20:58:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 108 states have internal predecessors, (118), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (45), 32 states have call predecessors, (45), 33 states have call successors, (45) [2021-11-16 20:58:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2021-11-16 20:58:59,399 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 88 [2021-11-16 20:58:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:59,399 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2021-11-16 20:58:59,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-16 20:58:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2021-11-16 20:58:59,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-16 20:58:59,403 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:59,403 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:58:59,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-16 20:58:59,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:59,625 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:59,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:59,625 INFO L85 PathProgramCache]: Analyzing trace with hash 199393165, now seen corresponding path program 1 times [2021-11-16 20:58:59,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:59,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727368936] [2021-11-16 20:58:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:59,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:58:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:58:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:59,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:58:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:59,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 20:58:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:59,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 20:58:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:59,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-16 20:58:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:59,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 20:58:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:59,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-16 20:58:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:59,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-16 20:58:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:59,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-16 20:58:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-11-16 20:58:59,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:59,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727368936] [2021-11-16 20:58:59,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727368936] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:59,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920569271] [2021-11-16 20:58:59,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:59,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:59,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:59,940 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:58:59,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-16 20:59:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:00,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 2563 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-16 20:59:00,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:00,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-16 20:59:00,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-16 20:59:00,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-11-16 20:59:00,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-11-16 20:59:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-16 20:59:00,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:59:00,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920569271] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:00,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:59:00,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2021-11-16 20:59:00,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286463666] [2021-11-16 20:59:00,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:00,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:59:00,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:00,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:59:00,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:59:00,683 INFO L87 Difference]: Start difference. First operand 155 states and 198 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-16 20:59:01,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:01,246 INFO L93 Difference]: Finished difference Result 296 states and 379 transitions. [2021-11-16 20:59:01,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:59:01,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 95 [2021-11-16 20:59:01,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:01,247 INFO L225 Difference]: With dead ends: 296 [2021-11-16 20:59:01,247 INFO L226 Difference]: Without dead ends: 173 [2021-11-16 20:59:01,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-11-16 20:59:01,248 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 36 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:01,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 693 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 95 Invalid, 0 Unknown, 23 Unchecked, 0.5s Time] [2021-11-16 20:59:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-11-16 20:59:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 160. [2021-11-16 20:59:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 109 states have (on average 1.1192660550458715) internal successors, (122), 113 states have internal predecessors, (122), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (44), 31 states have call predecessors, (44), 33 states have call successors, (44) [2021-11-16 20:59:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 201 transitions. [2021-11-16 20:59:01,254 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 201 transitions. Word has length 95 [2021-11-16 20:59:01,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:01,254 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 201 transitions. [2021-11-16 20:59:01,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-16 20:59:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 201 transitions. [2021-11-16 20:59:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-16 20:59:01,256 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:01,256 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:01,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-16 20:59:01,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-16 20:59:01,471 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:01,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:01,472 INFO L85 PathProgramCache]: Analyzing trace with hash -442406659, now seen corresponding path program 1 times [2021-11-16 20:59:01,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:01,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519954000] [2021-11-16 20:59:01,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:01,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:59:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-16 20:59:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-16 20:59:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 20:59:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 20:59:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-16 20:59:01,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:01,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519954000] [2021-11-16 20:59:01,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519954000] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:01,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099965121] [2021-11-16 20:59:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:01,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:01,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:01,807 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:59:01,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-16 20:59:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 2520 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-16 20:59:02,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:02,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-16 20:59:02,744 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-16 20:59:02,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 31 [2021-11-16 20:59:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-16 20:59:02,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:59:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-16 20:59:03,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099965121] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 20:59:03,030 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 20:59:03,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 10] total 20 [2021-11-16 20:59:03,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145400783] [2021-11-16 20:59:03,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 20:59:03,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-16 20:59:03,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:03,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-16 20:59:03,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-11-16 20:59:03,031 INFO L87 Difference]: Start difference. First operand 160 states and 201 transitions. Second operand has 20 states, 20 states have (on average 4.45) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2021-11-16 20:59:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:07,226 INFO L93 Difference]: Finished difference Result 266 states and 350 transitions. [2021-11-16 20:59:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-16 20:59:07,227 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.45) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 82 [2021-11-16 20:59:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:07,228 INFO L225 Difference]: With dead ends: 266 [2021-11-16 20:59:07,228 INFO L226 Difference]: Without dead ends: 192 [2021-11-16 20:59:07,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 163 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2021-11-16 20:59:07,229 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 97 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:07,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 1021 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 633 Invalid, 0 Unknown, 81 Unchecked, 4.0s Time] [2021-11-16 20:59:07,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-11-16 20:59:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 167. [2021-11-16 20:59:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 115 states have (on average 1.1043478260869566) internal successors, (127), 119 states have internal predecessors, (127), 35 states have call successors, (35), 16 states have call predecessors, (35), 16 states have return successors, (44), 31 states have call predecessors, (44), 33 states have call successors, (44) [2021-11-16 20:59:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 206 transitions. [2021-11-16 20:59:07,244 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 206 transitions. Word has length 82 [2021-11-16 20:59:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:07,245 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 206 transitions. [2021-11-16 20:59:07,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.45) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2021-11-16 20:59:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 206 transitions. [2021-11-16 20:59:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-16 20:59:07,246 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:07,246 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:07,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-16 20:59:07,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-16 20:59:07,466 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:07,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:07,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1702906197, now seen corresponding path program 1 times [2021-11-16 20:59:07,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:07,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134987491] [2021-11-16 20:59:07,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:07,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:59:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-16 20:59:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-16 20:59:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:59:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:59:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:59:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-11-16 20:59:07,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:07,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134987491] [2021-11-16 20:59:07,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134987491] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:07,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:59:07,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 20:59:07,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448567614] [2021-11-16 20:59:07,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:07,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:59:07,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:07,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:59:07,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:59:07,672 INFO L87 Difference]: Start difference. First operand 167 states and 206 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-16 20:59:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:07,720 INFO L93 Difference]: Finished difference Result 175 states and 214 transitions. [2021-11-16 20:59:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:59:07,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 83 [2021-11-16 20:59:07,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:07,722 INFO L225 Difference]: With dead ends: 175 [2021-11-16 20:59:07,722 INFO L226 Difference]: Without dead ends: 173 [2021-11-16 20:59:07,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:59:07,723 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 16 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:07,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 726 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:59:07,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-11-16 20:59:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2021-11-16 20:59:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 118 states have (on average 1.1016949152542372) internal successors, (130), 122 states have internal predecessors, (130), 36 states have call successors, (36), 17 states have call predecessors, (36), 17 states have return successors, (45), 32 states have call predecessors, (45), 34 states have call successors, (45) [2021-11-16 20:59:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 211 transitions. [2021-11-16 20:59:07,730 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 211 transitions. Word has length 83 [2021-11-16 20:59:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:07,730 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 211 transitions. [2021-11-16 20:59:07,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-16 20:59:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 211 transitions. [2021-11-16 20:59:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-16 20:59:07,731 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:07,731 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:07,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-16 20:59:07,732 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 558656115, now seen corresponding path program 1 times [2021-11-16 20:59:07,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:07,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965232524] [2021-11-16 20:59:07,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:07,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:59:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-16 20:59:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-16 20:59:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:59:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:59:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:07,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:59:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-11-16 20:59:08,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:08,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965232524] [2021-11-16 20:59:08,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965232524] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:08,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468644459] [2021-11-16 20:59:08,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:08,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:08,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:08,041 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:59:08,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-16 20:59:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:09,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-16 20:59:09,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:09,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-16 20:59:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 31 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-16 20:59:10,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:59:10,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468644459] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:10,917 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 20:59:10,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2021-11-16 20:59:10,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996288036] [2021-11-16 20:59:10,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 20:59:10,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-16 20:59:10,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:10,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-16 20:59:10,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2021-11-16 20:59:10,919 INFO L87 Difference]: Start difference. First operand 172 states and 211 transitions. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 22 states have internal predecessors, (89), 10 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (20), 10 states have call predecessors, (20), 9 states have call successors, (20) [2021-11-16 20:59:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:12,978 INFO L93 Difference]: Finished difference Result 285 states and 370 transitions. [2021-11-16 20:59:12,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-16 20:59:12,979 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 22 states have internal predecessors, (89), 10 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (20), 10 states have call predecessors, (20), 9 states have call successors, (20) Word has length 87 [2021-11-16 20:59:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:12,980 INFO L225 Difference]: With dead ends: 285 [2021-11-16 20:59:12,980 INFO L226 Difference]: Without dead ends: 223 [2021-11-16 20:59:12,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 116 SyntacticMatches, 17 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=235, Invalid=1487, Unknown=0, NotChecked=0, Total=1722 [2021-11-16 20:59:12,981 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 152 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:12,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 1107 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 790 Invalid, 0 Unknown, 173 Unchecked, 1.6s Time] [2021-11-16 20:59:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-11-16 20:59:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2021-11-16 20:59:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 132 states have (on average 1.0909090909090908) internal successors, (144), 136 states have internal predecessors, (144), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (55), 40 states have call predecessors, (55), 41 states have call successors, (55) [2021-11-16 20:59:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 242 transitions. [2021-11-16 20:59:12,989 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 242 transitions. Word has length 87 [2021-11-16 20:59:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:12,990 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 242 transitions. [2021-11-16 20:59:12,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 22 states have internal predecessors, (89), 10 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (20), 10 states have call predecessors, (20), 9 states have call successors, (20) [2021-11-16 20:59:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 242 transitions. [2021-11-16 20:59:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-16 20:59:12,991 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:12,991 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:13,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-16 20:59:13,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-16 20:59:13,203 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:13,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:13,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2022463225, now seen corresponding path program 1 times [2021-11-16 20:59:13,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:13,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436697754] [2021-11-16 20:59:13,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:13,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 20:59:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:59:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 20:59:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:59:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:59:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:59:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 20:59:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-16 20:59:13,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:13,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436697754] [2021-11-16 20:59:13,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436697754] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:13,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250368323] [2021-11-16 20:59:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:13,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:13,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:13,473 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:59:13,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-16 20:59:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 2558 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-16 20:59:13,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:14,423 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-16 20:59:14,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 33 [2021-11-16 20:59:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 47 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-16 20:59:14,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:59:14,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-11-16 20:59:14,721 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-16 20:59:14,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2021-11-16 20:59:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-16 20:59:14,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250368323] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 20:59:14,767 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 20:59:14,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 20 [2021-11-16 20:59:14,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005597419] [2021-11-16 20:59:14,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 20:59:14,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-16 20:59:14,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:14,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-16 20:59:14,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-11-16 20:59:14,768 INFO L87 Difference]: Start difference. First operand 196 states and 242 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 17 states have internal predecessors, (105), 7 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2021-11-16 20:59:16,619 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:59:19,256 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:59:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:21,084 INFO L93 Difference]: Finished difference Result 332 states and 422 transitions. [2021-11-16 20:59:21,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-16 20:59:21,085 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 17 states have internal predecessors, (105), 7 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 96 [2021-11-16 20:59:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:21,086 INFO L225 Difference]: With dead ends: 332 [2021-11-16 20:59:21,086 INFO L226 Difference]: Without dead ends: 247 [2021-11-16 20:59:21,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 194 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2021-11-16 20:59:21,087 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 107 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 416 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:21,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 982 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1210 Invalid, 0 Unknown, 416 Unchecked, 5.9s Time] [2021-11-16 20:59:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-11-16 20:59:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 229. [2021-11-16 20:59:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 158 states have (on average 1.0949367088607596) internal successors, (173), 163 states have internal predecessors, (173), 47 states have call successors, (47), 22 states have call predecessors, (47), 23 states have return successors, (57), 43 states have call predecessors, (57), 45 states have call successors, (57) [2021-11-16 20:59:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 277 transitions. [2021-11-16 20:59:21,099 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 277 transitions. Word has length 96 [2021-11-16 20:59:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:21,099 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 277 transitions. [2021-11-16 20:59:21,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 17 states have internal predecessors, (105), 7 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2021-11-16 20:59:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 277 transitions. [2021-11-16 20:59:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-16 20:59:21,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:21,101 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:21,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-16 20:59:21,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-16 20:59:21,311 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:21,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:21,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1386307521, now seen corresponding path program 1 times [2021-11-16 20:59:21,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:21,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291789905] [2021-11-16 20:59:21,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:21,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:59:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:59:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:59:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 20:59:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:59:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 20:59:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-11-16 20:59:21,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:21,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291789905] [2021-11-16 20:59:21,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291789905] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:21,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:59:21,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 20:59:21,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952310357] [2021-11-16 20:59:21,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:21,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:59:21,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:21,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:59:21,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:59:21,517 INFO L87 Difference]: Start difference. First operand 229 states and 277 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-16 20:59:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:21,978 INFO L93 Difference]: Finished difference Result 237 states and 285 transitions. [2021-11-16 20:59:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:59:21,979 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 100 [2021-11-16 20:59:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:21,980 INFO L225 Difference]: With dead ends: 237 [2021-11-16 20:59:21,980 INFO L226 Difference]: Without dead ends: 235 [2021-11-16 20:59:21,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:59:21,981 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 52 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:21,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 524 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-16 20:59:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-11-16 20:59:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2021-11-16 20:59:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 161 states have (on average 1.093167701863354) internal successors, (176), 166 states have internal predecessors, (176), 48 states have call successors, (48), 23 states have call predecessors, (48), 24 states have return successors, (58), 44 states have call predecessors, (58), 46 states have call successors, (58) [2021-11-16 20:59:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 282 transitions. [2021-11-16 20:59:21,990 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 282 transitions. Word has length 100 [2021-11-16 20:59:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:21,990 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 282 transitions. [2021-11-16 20:59:21,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-16 20:59:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 282 transitions. [2021-11-16 20:59:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-16 20:59:21,991 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:21,992 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:21,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-16 20:59:21,992 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:21,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:21,992 INFO L85 PathProgramCache]: Analyzing trace with hash 511430444, now seen corresponding path program 1 times [2021-11-16 20:59:21,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:21,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377463886] [2021-11-16 20:59:21,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:21,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:22,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:22,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:22,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 20:59:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:22,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:22,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:59:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:22,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 20:59:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:22,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:59:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:22,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:59:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:22,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:59:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 20:59:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:22,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:59:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-11-16 20:59:22,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:22,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377463886] [2021-11-16 20:59:22,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377463886] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:22,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103600755] [2021-11-16 20:59:22,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:22,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:22,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:22,211 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:59:22,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-16 20:59:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:22,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 2575 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-16 20:59:22,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:22,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-16 20:59:23,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2021-11-16 20:59:23,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-11-16 20:59:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-16 20:59:23,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:59:23,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103600755] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:23,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:59:23,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 23 [2021-11-16 20:59:23,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415033308] [2021-11-16 20:59:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:23,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-16 20:59:23,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:23,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-16 20:59:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-11-16 20:59:23,248 INFO L87 Difference]: Start difference. First operand 234 states and 282 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 12 states have internal predecessors, (63), 6 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2021-11-16 20:59:25,862 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:59:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:26,254 INFO L93 Difference]: Finished difference Result 365 states and 448 transitions. [2021-11-16 20:59:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-16 20:59:26,255 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 12 states have internal predecessors, (63), 6 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 99 [2021-11-16 20:59:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:26,256 INFO L225 Difference]: With dead ends: 365 [2021-11-16 20:59:26,256 INFO L226 Difference]: Without dead ends: 231 [2021-11-16 20:59:26,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2021-11-16 20:59:26,257 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 118 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 490 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:26,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 616 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 342 Invalid, 0 Unknown, 490 Unchecked, 2.9s Time] [2021-11-16 20:59:26,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-11-16 20:59:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 217. [2021-11-16 20:59:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 151 states have (on average 1.086092715231788) internal successors, (164), 155 states have internal predecessors, (164), 42 states have call successors, (42), 22 states have call predecessors, (42), 23 states have return successors, (51), 39 states have call predecessors, (51), 40 states have call successors, (51) [2021-11-16 20:59:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2021-11-16 20:59:26,279 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 99 [2021-11-16 20:59:26,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:26,279 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2021-11-16 20:59:26,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 12 states have internal predecessors, (63), 6 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2021-11-16 20:59:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2021-11-16 20:59:26,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-16 20:59:26,280 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:26,280 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:26,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-16 20:59:26,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-16 20:59:26,497 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:26,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:26,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2111461513, now seen corresponding path program 1 times [2021-11-16 20:59:26,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:26,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347334209] [2021-11-16 20:59:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:26,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:59:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:59:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:59:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 20:59:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:59:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 20:59:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 22 proven. 23 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-16 20:59:26,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:26,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347334209] [2021-11-16 20:59:26,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347334209] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:26,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740803644] [2021-11-16 20:59:26,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:26,938 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:26,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:26,939 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:59:26,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-16 20:59:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:27,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 2564 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-16 20:59:27,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:27,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-16 20:59:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-16 20:59:27,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:59:28,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740803644] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:28,061 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 20:59:28,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 25 [2021-11-16 20:59:28,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689061490] [2021-11-16 20:59:28,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 20:59:28,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-16 20:59:28,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:28,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-16 20:59:28,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2021-11-16 20:59:28,063 INFO L87 Difference]: Start difference. First operand 217 states and 257 transitions. Second operand has 25 states, 25 states have (on average 3.44) internal successors, (86), 24 states have internal predecessors, (86), 10 states have call successors, (27), 5 states have call predecessors, (27), 7 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2021-11-16 20:59:30,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:30,454 INFO L93 Difference]: Finished difference Result 333 states and 420 transitions. [2021-11-16 20:59:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-16 20:59:30,455 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 24 states have internal predecessors, (86), 10 states have call successors, (27), 5 states have call predecessors, (27), 7 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Word has length 104 [2021-11-16 20:59:30,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:30,456 INFO L225 Difference]: With dead ends: 333 [2021-11-16 20:59:30,456 INFO L226 Difference]: Without dead ends: 273 [2021-11-16 20:59:30,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 142 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=310, Invalid=2042, Unknown=0, NotChecked=0, Total=2352 [2021-11-16 20:59:30,458 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 268 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 542 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:30,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 466 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1080 Invalid, 0 Unknown, 542 Unchecked, 1.8s Time] [2021-11-16 20:59:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-16 20:59:30,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 239. [2021-11-16 20:59:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 164 states have (on average 1.0853658536585367) internal successors, (178), 169 states have internal predecessors, (178), 49 states have call successors, (49), 23 states have call predecessors, (49), 25 states have return successors, (65), 46 states have call predecessors, (65), 47 states have call successors, (65) [2021-11-16 20:59:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 292 transitions. [2021-11-16 20:59:30,478 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 292 transitions. Word has length 104 [2021-11-16 20:59:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:30,478 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 292 transitions. [2021-11-16 20:59:30,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 24 states have internal predecessors, (86), 10 states have call successors, (27), 5 states have call predecessors, (27), 7 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2021-11-16 20:59:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 292 transitions. [2021-11-16 20:59:30,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-16 20:59:30,479 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:30,479 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:30,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-11-16 20:59:30,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:30,700 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:30,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:30,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1453833491, now seen corresponding path program 1 times [2021-11-16 20:59:30,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:30,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704611229] [2021-11-16 20:59:30,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:30,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 20:59:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:59:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 20:59:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 20:59:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 20:59:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 20:59:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 20:59:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 20:59:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 20:59:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-16 20:59:30,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:30,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704611229] [2021-11-16 20:59:30,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704611229] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:30,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802122663] [2021-11-16 20:59:30,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:30,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:30,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:30,935 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:59:30,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-16 20:59:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 2596 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-16 20:59:31,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:31,483 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-11-16 20:59:31,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2021-11-16 20:59:31,719 INFO L354 Elim1Store]: treesize reduction 212, result has 36.3 percent of original size [2021-11-16 20:59:31,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 102 treesize of output 194 [2021-11-16 20:59:33,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:59:33,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:59:33,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:59:33,622 INFO L354 Elim1Store]: treesize reduction 14, result has 65.9 percent of original size [2021-11-16 20:59:33,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 410 treesize of output 364 [2021-11-16 20:59:35,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:59:35,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:59:35,489 INFO L354 Elim1Store]: treesize reduction 68, result has 37.6 percent of original size [2021-11-16 20:59:35,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 421 treesize of output 385 [2021-11-16 21:00:45,090 INFO L354 Elim1Store]: treesize reduction 61, result has 16.4 percent of original size [2021-11-16 21:00:45,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 207 treesize of output 153 [2021-11-16 21:00:45,377 INFO L354 Elim1Store]: treesize reduction 88, result has 31.8 percent of original size [2021-11-16 21:00:45,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 435 treesize of output 383 [2021-11-16 21:01:36,203 WARN L227 SmtUtils]: Spent 19.90s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 21:02:25,656 WARN L227 SmtUtils]: Spent 19.64s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 21:02:58,766 WARN L227 SmtUtils]: Spent 19.31s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 21:03:28,110 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_save_byte_from_array_~array#1.base| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int) (v_arrayElimIndex_1 Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|))) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|)) (.cse1 (select .cse4 v_arrayElimIndex_1)) (.cse2 (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (and (<= (mod (select .cse0 |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) 9223372036854775807) (= .cse1 (select .cse0 .cse2)) (let ((.cse3 (exists ((v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25 Int)) (let ((.cse8 (select (select |c_#memory_int| v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25) 0))) (< (div (+ 18446744073709551615 (* .cse8 (- 1))) (- 18446744073709551616)) (div (+ 18446744073709551615 .cse8) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_save_byte_from_array_~storage#1.base| |ULTIMATE.start_save_byte_from_array_~array#1.base|))) (.cse5 (= .cse2 0))) (or (and .cse3 (or (= .cse1 (select .cse4 (+ v_arrayElimIndex_1 (- 18446744073709551616)))) (not (= v_arrayElimIndex_1 .cse2)))) (and .cse5 .cse6) (= |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 0) (and (exists ((v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25 Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|) v_arrayElimIndex_1) (select (select |c_#memory_int| v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25) 0))) (let ((.cse7 (* .cse1 (- 1)))) (< (div (+ 18446744073709551615 .cse7) (- 18446744073709551616)) (div .cse7 (- 18446744073709551616))))) (and .cse3 .cse6) (and .cse5 (not (= v_arrayElimIndex_1 0))))))))) (exists ((|ULTIMATE.start_save_byte_from_array_~array#1.base| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int) (v_arrayElimIndex_1 Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|)) (.cse11 (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse13 (select .cse9 .cse11)) (.cse15 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|))) (and (< 9223372036854775807 (mod (select .cse9 |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616)) (or (exists ((v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25 Int)) (and (not (= |ULTIMATE.start_save_byte_from_array_~array#1.base| v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25)) (or (let ((.cse10 (select (select |c_#memory_int| v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25) 0))) (< (div (+ 18446744073709551615 (* .cse10 (- 1))) (- 18446744073709551616)) (div (+ 18446744073709551615 .cse10) 18446744073709551616))) (and (= |ULTIMATE.start_save_byte_from_array_~storage#1.base| v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25) (= (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) 0))))) (let ((.cse12 (select .cse15 v_arrayElimIndex_1))) (and (or (exists ((v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25 Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|) v_arrayElimIndex_1) (select (select |c_#memory_int| v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25) 0))) (= .cse11 0)) (or (= .cse12 .cse13) (not (= v_arrayElimIndex_1 18446744073709551616))) (let ((.cse14 (* .cse12 (- 1)))) (< (div (+ 18446744073709551615 .cse14) (- 18446744073709551616)) (div .cse14 (- 18446744073709551616)))))) (and (not (= v_arrayElimIndex_1 0)) (or (exists ((aux_div_v_arrayElimCell_17_84 Int) (aux_div_aux_mod_v_arrayElimCell_17_84_148 Int)) (and (< aux_div_v_arrayElimCell_17_84 aux_div_aux_mod_v_arrayElimCell_17_84_148) (let ((.cse18 (* 18446744073709551616 aux_div_aux_mod_v_arrayElimCell_17_84_148)) (.cse17 (* 18446744073709551616 aux_div_v_arrayElimCell_17_84)) (.cse19 (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (or (let ((.cse16 (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse19))) (and (<= .cse16 (+ 18446744073709551615 .cse17)) (exists ((v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25 Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|) (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8)) (select (select |c_#memory_int| v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25) 0))) (< .cse18 (+ 18446744073709551616 .cse16)))) (and (or (and (< .cse18 (+ 36893488147419103231 .cse17)) (= .cse19 0)) (exists ((v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25 Int)) (let ((.cse20 (select (select |c_#memory_int| v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25) 0))) (and (< (* 18446744073709551616 aux_div_aux_mod_v_arrayElimCell_17_84_148) (+ 18446744073709551616 .cse20)) (<= .cse20 (+ 18446744073709551615 (* 18446744073709551616 aux_div_v_arrayElimCell_17_84))))))) (not (= v_arrayElimIndex_1 18446744073709551616))))))) (= |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 0)))) (= .cse13 (select .cse15 (+ v_arrayElimIndex_1 (- 18446744073709551616)))))))) (exists ((|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.base| Int)) (let ((.cse23 (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8)) (.cse21 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (and (< 9223372036854775807 (mod (select .cse21 |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616)) (or (exists ((v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25 Int)) (let ((.cse22 (select (select |c_#memory_int| v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25) 0))) (< (div (+ 18446744073709551615 (* .cse22 (- 1))) (- 18446744073709551616)) (div (+ 18446744073709551615 .cse22) 18446744073709551616)))) (= .cse23 0)) (= (select .cse21 .cse23) (select .cse21 (+ (- 18446744073709551608) |ULTIMATE.start_save_byte_from_array_~storage#1.offset|)))))) (exists ((|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.base| Int)) (and (<= (mod (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|) |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) 9223372036854775807) (or (exists ((v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25 Int)) (and (not (= |ULTIMATE.start_save_byte_from_array_~storage#1.base| v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25)) (let ((.cse24 (select (select |c_#memory_int| v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25) 0))) (< (div (+ 18446744073709551615 (* .cse24 (- 1))) (- 18446744073709551616)) (div (+ 18446744073709551615 .cse24) 18446744073709551616))))) (and (exists ((v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25 Int)) (let ((.cse25 (select (select |c_#memory_int| v_aws_byte_cursor_right_trim_pred_~source.base_BEFORE_CALL_25) 0))) (< (div (+ 18446744073709551615 (* .cse25 (- 1))) (- 18446744073709551616)) (div (+ 18446744073709551615 .cse25) 18446744073709551616)))) (not (= (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) 0))))))) is different from true [2021-11-16 21:04:14,788 WARN L227 SmtUtils]: Spent 19.70s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 21:04:55,385 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-16 21:04:55,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 31 [2021-11-16 21:04:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-16 21:04:58,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:05:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-16 21:05:00,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802122663] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:05:00,099 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 21:05:00,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 8] total 25 [2021-11-16 21:05:00,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965307864] [2021-11-16 21:05:00,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 21:05:00,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-16 21:05:00,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-16 21:05:00,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=485, Unknown=8, NotChecked=44, Total=600 [2021-11-16 21:05:00,100 INFO L87 Difference]: Start difference. First operand 239 states and 292 transitions. Second operand has 25 states, 24 states have (on average 4.541666666666667) internal successors, (109), 22 states have internal predecessors, (109), 9 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (23), 7 states have call predecessors, (23), 8 states have call successors, (23) [2021-11-16 21:05:02,075 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:05:03,644 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:05:43,527 WARN L227 SmtUtils]: Spent 19.41s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 21:06:03,153 WARN L227 SmtUtils]: Spent 19.49s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 21:06:48,582 WARN L227 SmtUtils]: Spent 19.44s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 21:07:19,077 WARN L227 SmtUtils]: Spent 19.55s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 21:07:58,063 WARN L227 SmtUtils]: Spent 32.36s on a formula simplification. DAG size of input: 142 DAG size of output: 134 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 21:08:06,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:08:06,650 INFO L93 Difference]: Finished difference Result 366 states and 456 transitions. [2021-11-16 21:08:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-16 21:08:06,651 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.541666666666667) internal successors, (109), 22 states have internal predecessors, (109), 9 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (23), 7 states have call predecessors, (23), 8 states have call successors, (23) Word has length 106 [2021-11-16 21:08:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:08:06,652 INFO L225 Difference]: With dead ends: 366 [2021-11-16 21:08:06,652 INFO L226 Difference]: Without dead ends: 260 [2021-11-16 21:08:06,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 213 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 286.0s TimeCoverageRelationStatistics Valid=183, Invalid=1507, Unknown=36, NotChecked=80, Total=1806 [2021-11-16 21:08:06,655 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 113 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 718 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2021-11-16 21:08:06,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 785 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 749 Invalid, 0 Unknown, 718 Unchecked, 9.8s Time] [2021-11-16 21:08:06,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-11-16 21:08:06,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 246. [2021-11-16 21:08:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 169 states have (on average 1.0710059171597632) internal successors, (181), 173 states have internal predecessors, (181), 50 states have call successors, (50), 25 states have call predecessors, (50), 26 states have return successors, (66), 47 states have call predecessors, (66), 48 states have call successors, (66) [2021-11-16 21:08:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 297 transitions. [2021-11-16 21:08:06,671 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 297 transitions. Word has length 106 [2021-11-16 21:08:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:08:06,671 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 297 transitions. [2021-11-16 21:08:06,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.541666666666667) internal successors, (109), 22 states have internal predecessors, (109), 9 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (23), 7 states have call predecessors, (23), 8 states have call successors, (23) [2021-11-16 21:08:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 297 transitions. [2021-11-16 21:08:06,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-16 21:08:06,672 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:08:06,672 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:08:06,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-16 21:08:06,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:08:06,887 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:08:06,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:08:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1690843138, now seen corresponding path program 1 times [2021-11-16 21:08:06,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:08:06,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313987841] [2021-11-16 21:08:06,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:08:06,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:08:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:08,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:08:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:08,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:08:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:08,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:08:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:09,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:08:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:08:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:08:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:09,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:08:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:09,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 21:08:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:09,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 21:08:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:09,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 21:08:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:09,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 21:08:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:09,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 21:08:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-11-16 21:08:10,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:08:10,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313987841] [2021-11-16 21:08:10,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313987841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:08:10,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:08:10,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-16 21:08:10,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262326457] [2021-11-16 21:08:10,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:08:10,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-16 21:08:10,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:08:10,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-16 21:08:10,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-11-16 21:08:10,715 INFO L87 Difference]: Start difference. First operand 246 states and 297 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 15 states have internal predecessors, (56), 8 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2021-11-16 21:08:13,721 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:08:14,809 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:08:17,262 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:08:19,876 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:08:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:08:31,917 INFO L93 Difference]: Finished difference Result 367 states and 461 transitions. [2021-11-16 21:08:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-16 21:08:31,917 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 15 states have internal predecessors, (56), 8 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 109 [2021-11-16 21:08:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:08:31,919 INFO L225 Difference]: With dead ends: 367 [2021-11-16 21:08:31,919 INFO L226 Difference]: Without dead ends: 293 [2021-11-16 21:08:31,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2021-11-16 21:08:31,920 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 110 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 68 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2021-11-16 21:08:31,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 593 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1309 Invalid, 1 Unknown, 0 Unchecked, 18.5s Time] [2021-11-16 21:08:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-16 21:08:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 257. [2021-11-16 21:08:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 176 states have (on average 1.0681818181818181) internal successors, (188), 181 states have internal predecessors, (188), 52 states have call successors, (52), 25 states have call predecessors, (52), 28 states have return successors, (77), 50 states have call predecessors, (77), 50 states have call successors, (77) [2021-11-16 21:08:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 317 transitions. [2021-11-16 21:08:31,934 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 317 transitions. Word has length 109 [2021-11-16 21:08:31,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:08:31,934 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 317 transitions. [2021-11-16 21:08:31,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 15 states have internal predecessors, (56), 8 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2021-11-16 21:08:31,934 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 317 transitions. [2021-11-16 21:08:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-16 21:08:31,935 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:08:31,935 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:08:31,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-16 21:08:31,936 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:08:31,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:08:31,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1949008576, now seen corresponding path program 1 times [2021-11-16 21:08:31,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:08:31,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637287718] [2021-11-16 21:08:31,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:08:31,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:08:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:08:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:08:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:32,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:08:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:08:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:32,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:08:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:08:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:08:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 21:08:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 21:08:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:32,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 21:08:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:32,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 21:08:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 21:08:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-11-16 21:08:32,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:08:32,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637287718] [2021-11-16 21:08:32,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637287718] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:08:32,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:08:32,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:08:32,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927197237] [2021-11-16 21:08:32,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:08:32,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:08:32,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:08:32,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:08:32,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:08:32,360 INFO L87 Difference]: Start difference. First operand 257 states and 317 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-16 21:08:34,173 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:08:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:08:35,693 INFO L93 Difference]: Finished difference Result 340 states and 428 transitions. [2021-11-16 21:08:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:08:35,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2021-11-16 21:08:35,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:08:35,697 INFO L225 Difference]: With dead ends: 340 [2021-11-16 21:08:35,697 INFO L226 Difference]: Without dead ends: 250 [2021-11-16 21:08:35,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:08:35,697 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 44 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:08:35,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 248 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-11-16 21:08:35,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-11-16 21:08:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2021-11-16 21:08:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 170 states have (on average 1.0647058823529412) internal successors, (181), 174 states have internal predecessors, (181), 52 states have call successors, (52), 25 states have call predecessors, (52), 27 states have return successors, (69), 50 states have call predecessors, (69), 50 states have call successors, (69) [2021-11-16 21:08:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 302 transitions. [2021-11-16 21:08:35,717 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 302 transitions. Word has length 109 [2021-11-16 21:08:35,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:08:35,717 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 302 transitions. [2021-11-16 21:08:35,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-16 21:08:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 302 transitions. [2021-11-16 21:08:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-16 21:08:35,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:08:35,718 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:08:35,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-16 21:08:35,719 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:08:35,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:08:35,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1466498319, now seen corresponding path program 1 times [2021-11-16 21:08:35,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:08:35,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783447372] [2021-11-16 21:08:35,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:08:35,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:08:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:35,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:08:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:35,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:08:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:35,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:08:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:35,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:08:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:35,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:08:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:35,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:08:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:35,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:08:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:36,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:08:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:36,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:08:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:36,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:08:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:36,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:08:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:36,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:08:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:36,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:08:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:36,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 21:08:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:36,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 21:08:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-11-16 21:08:36,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:08:36,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783447372] [2021-11-16 21:08:36,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783447372] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:08:36,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:08:36,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 21:08:36,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000959849] [2021-11-16 21:08:36,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:08:36,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:08:36,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:08:36,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:08:36,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:08:36,330 INFO L87 Difference]: Start difference. First operand 250 states and 302 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 21:08:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:08:38,363 INFO L93 Difference]: Finished difference Result 263 states and 315 transitions. [2021-11-16 21:08:38,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:08:38,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2021-11-16 21:08:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:08:38,365 INFO L225 Difference]: With dead ends: 263 [2021-11-16 21:08:38,365 INFO L226 Difference]: Without dead ends: 247 [2021-11-16 21:08:38,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:08:38,365 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 50 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-16 21:08:38,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 230 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-16 21:08:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-11-16 21:08:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2021-11-16 21:08:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 166 states have (on average 1.0602409638554218) internal successors, (176), 170 states have internal predecessors, (176), 52 states have call successors, (52), 24 states have call predecessors, (52), 26 states have return successors, (68), 50 states have call predecessors, (68), 50 states have call successors, (68) [2021-11-16 21:08:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 296 transitions. [2021-11-16 21:08:38,378 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 296 transitions. Word has length 112 [2021-11-16 21:08:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:08:38,379 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 296 transitions. [2021-11-16 21:08:38,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 21:08:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 296 transitions. [2021-11-16 21:08:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-11-16 21:08:38,380 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:08:38,380 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:08:38,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-16 21:08:38,380 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:08:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:08:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash -641051383, now seen corresponding path program 1 times [2021-11-16 21:08:38,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:08:38,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561422488] [2021-11-16 21:08:38,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:08:38,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:08:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:38,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:08:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:38,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:08:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:38,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:08:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:38,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:08:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:38,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:08:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:38,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:08:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:38,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:08:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 21:08:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:38,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 21:08:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:38,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 21:08:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:38,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 21:08:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 21:08:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-11-16 21:08:40,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:08:40,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561422488] [2021-11-16 21:08:40,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561422488] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:08:40,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:08:40,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-16 21:08:40,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901571264] [2021-11-16 21:08:40,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:08:40,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 21:08:40,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:08:40,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 21:08:40,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:08:40,364 INFO L87 Difference]: Start difference. First operand 245 states and 296 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-16 21:08:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:08:47,054 INFO L93 Difference]: Finished difference Result 253 states and 304 transitions. [2021-11-16 21:08:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 21:08:47,054 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2021-11-16 21:08:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:08:47,056 INFO L225 Difference]: With dead ends: 253 [2021-11-16 21:08:47,056 INFO L226 Difference]: Without dead ends: 251 [2021-11-16 21:08:47,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-11-16 21:08:47,056 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 77 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-11-16 21:08:47,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 835 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2021-11-16 21:08:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-11-16 21:08:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2021-11-16 21:08:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 169 states have (on average 1.0591715976331362) internal successors, (179), 173 states have internal predecessors, (179), 53 states have call successors, (53), 25 states have call predecessors, (53), 27 states have return successors, (69), 51 states have call predecessors, (69), 51 states have call successors, (69) [2021-11-16 21:08:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 301 transitions. [2021-11-16 21:08:47,070 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 301 transitions. Word has length 111 [2021-11-16 21:08:47,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:08:47,070 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 301 transitions. [2021-11-16 21:08:47,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-16 21:08:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 301 transitions. [2021-11-16 21:08:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-16 21:08:47,071 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:08:47,071 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:08:47,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-16 21:08:47,072 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:08:47,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:08:47,072 INFO L85 PathProgramCache]: Analyzing trace with hash 964794292, now seen corresponding path program 1 times [2021-11-16 21:08:47,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:08:47,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165583763] [2021-11-16 21:08:47,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:08:47,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:08:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:08:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:08:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:08:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:08:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:08:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:08:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:08:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:08:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:08:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:08:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:08:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:08:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:08:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 21:08:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:47,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 21:08:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:48,088 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-11-16 21:08:48,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:08:48,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165583763] [2021-11-16 21:08:48,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165583763] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:08:48,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:08:48,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 21:08:48,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318110347] [2021-11-16 21:08:48,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:08:48,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:08:48,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:08:48,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:08:48,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:08:48,090 INFO L87 Difference]: Start difference. First operand 250 states and 301 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 21:08:49,717 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:08:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:08:52,755 INFO L93 Difference]: Finished difference Result 258 states and 309 transitions. [2021-11-16 21:08:52,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:08:52,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2021-11-16 21:08:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:08:52,756 INFO L225 Difference]: With dead ends: 258 [2021-11-16 21:08:52,756 INFO L226 Difference]: Without dead ends: 256 [2021-11-16 21:08:52,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:08:52,757 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 49 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2021-11-16 21:08:52,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 533 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2021-11-16 21:08:52,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-16 21:08:52,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2021-11-16 21:08:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 172 states have (on average 1.058139534883721) internal successors, (182), 176 states have internal predecessors, (182), 54 states have call successors, (54), 26 states have call predecessors, (54), 28 states have return successors, (70), 52 states have call predecessors, (70), 52 states have call successors, (70) [2021-11-16 21:08:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 306 transitions. [2021-11-16 21:08:52,769 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 306 transitions. Word has length 114 [2021-11-16 21:08:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:08:52,770 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 306 transitions. [2021-11-16 21:08:52,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 21:08:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 306 transitions. [2021-11-16 21:08:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-16 21:08:52,771 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:08:52,771 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:08:52,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-16 21:08:52,771 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:08:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:08:52,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1411369220, now seen corresponding path program 1 times [2021-11-16 21:08:52,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:08:52,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885627171] [2021-11-16 21:08:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:08:52,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:08:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:08:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:54,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:08:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:55,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:08:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:08:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:55,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:08:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:55,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:08:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:55,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:08:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:55,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 21:08:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:55,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 21:08:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:55,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 21:08:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:55,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 21:08:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:55,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 21:08:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-11-16 21:08:56,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:08:56,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885627171] [2021-11-16 21:08:56,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885627171] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:08:56,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330551774] [2021-11-16 21:08:56,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:08:56,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:08:56,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:08:56,970 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:08:56,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-16 21:08:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:08:57,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 2618 conjuncts, 80 conjunts are in the unsatisfiable core [2021-11-16 21:08:57,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:08:58,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-16 21:09:01,099 INFO L354 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-11-16 21:09:01,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2021-11-16 21:09:01,827 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-16 21:09:01,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 31 [2021-11-16 21:09:15,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:09:15,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2021-11-16 21:09:15,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:09:15,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-11-16 21:09:15,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-11-16 21:09:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-16 21:09:23,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:09:29,245 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-11-16 21:09:29,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 89 [2021-11-16 21:09:31,845 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse0 (+ c_aws_byte_cursor_right_trim_pred_~source.offset 8))) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| |aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select |c_#memory_$Pointer$.offset| |aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) |c_aws_byte_cursor_right_trim_pred_~#trimmed~0.offset| v_DerPreprocessor_1)) c_aws_byte_cursor_right_trim_pred_~source.base) .cse0) 0)) (and (= c_aws_byte_cursor_right_trim_pred_~source.base |aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) (= c_aws_byte_cursor_right_trim_pred_~source.offset |c_aws_byte_cursor_right_trim_pred_~#trimmed~0.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select |c_#memory_$Pointer$.base| |aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) |c_aws_byte_cursor_right_trim_pred_~#trimmed~0.offset| v_DerPreprocessor_2)) c_aws_byte_cursor_right_trim_pred_~source.base) .cse0) 0))))) is different from false [2021-11-16 21:09:32,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330551774] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:09:32,319 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 21:09:32,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 29] total 46 [2021-11-16 21:09:32,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66617729] [2021-11-16 21:09:32,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 21:09:32,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-16 21:09:32,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:09:32,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-16 21:09:32,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=2716, Unknown=2, NotChecked=106, Total=3080 [2021-11-16 21:09:32,321 INFO L87 Difference]: Start difference. First operand 255 states and 306 transitions. Second operand has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 40 states have internal predecessors, (127), 18 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (24), 17 states have call predecessors, (24), 17 states have call successors, (24) [2021-11-16 21:10:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:10:06,334 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2021-11-16 21:10:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-16 21:10:06,335 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 40 states have internal predecessors, (127), 18 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (24), 17 states have call predecessors, (24), 17 states have call successors, (24) Word has length 112 [2021-11-16 21:10:06,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:10:06,336 INFO L225 Difference]: With dead ends: 397 [2021-11-16 21:10:06,336 INFO L226 Difference]: Without dead ends: 330 [2021-11-16 21:10:06,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 127 SyntacticMatches, 8 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2801 ImplicationChecksByTransitivity, 46.2s TimeCoverageRelationStatistics Valid=653, Invalid=7904, Unknown=3, NotChecked=182, Total=8742 [2021-11-16 21:10:06,338 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 125 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 892 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2021-11-16 21:10:06,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 1626 Invalid, 2819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1826 Invalid, 0 Unknown, 892 Unchecked, 17.5s Time] [2021-11-16 21:10:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-11-16 21:10:06,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 269. [2021-11-16 21:10:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 184 states have (on average 1.059782608695652) internal successors, (195), 189 states have internal predecessors, (195), 54 states have call successors, (54), 28 states have call predecessors, (54), 30 states have return successors, (70), 51 states have call predecessors, (70), 52 states have call successors, (70) [2021-11-16 21:10:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 319 transitions. [2021-11-16 21:10:06,367 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 319 transitions. Word has length 112 [2021-11-16 21:10:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:10:06,369 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 319 transitions. [2021-11-16 21:10:06,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 40 states have internal predecessors, (127), 18 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (24), 17 states have call predecessors, (24), 17 states have call successors, (24) [2021-11-16 21:10:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 319 transitions. [2021-11-16 21:10:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-16 21:10:06,370 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:10:06,370 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:10:06,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-16 21:10:06,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-16 21:10:06,582 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:10:06,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:10:06,583 INFO L85 PathProgramCache]: Analyzing trace with hash 415964924, now seen corresponding path program 1 times [2021-11-16 21:10:06,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:10:06,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131973325] [2021-11-16 21:10:06,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:10:06,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:10:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:06,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:10:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:06,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:10:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:10:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:07,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:10:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:07,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:10:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:08,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:10:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:08,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:10:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:08,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:10:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:08,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:10:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:08,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:10:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:10:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:08,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:10:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:10:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:08,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 21:10:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:08,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 21:10:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 30 proven. 29 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-11-16 21:10:08,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:10:08,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131973325] [2021-11-16 21:10:08,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131973325] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:10:08,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563969494] [2021-11-16 21:10:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:10:08,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:10:08,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:10:08,977 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:10:08,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-16 21:10:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:09,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 2596 conjuncts, 57 conjunts are in the unsatisfiable core [2021-11-16 21:10:09,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:10:10,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-16 21:10:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-16 21:10:18,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:10:23,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563969494] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:10:23,778 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 21:10:23,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 31 [2021-11-16 21:10:23,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181368440] [2021-11-16 21:10:23,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 21:10:23,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-16 21:10:23,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:10:23,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-16 21:10:23,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1073, Unknown=1, NotChecked=0, Total=1190 [2021-11-16 21:10:23,783 INFO L87 Difference]: Start difference. First operand 269 states and 319 transitions. Second operand has 31 states, 30 states have (on average 3.2333333333333334) internal successors, (97), 27 states have internal predecessors, (97), 12 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (30), 13 states have call predecessors, (30), 11 states have call successors, (30) [2021-11-16 21:10:26,472 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:10:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:10:46,559 INFO L93 Difference]: Finished difference Result 414 states and 493 transitions. [2021-11-16 21:10:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-16 21:10:46,560 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.2333333333333334) internal successors, (97), 27 states have internal predecessors, (97), 12 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (30), 13 states have call predecessors, (30), 11 states have call successors, (30) Word has length 118 [2021-11-16 21:10:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:10:46,561 INFO L225 Difference]: With dead ends: 414 [2021-11-16 21:10:46,561 INFO L226 Difference]: Without dead ends: 339 [2021-11-16 21:10:46,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 151 SyntacticMatches, 14 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=271, Invalid=2590, Unknown=1, NotChecked=0, Total=2862 [2021-11-16 21:10:46,563 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 169 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 606 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:10:46,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 824 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1663 Invalid, 0 Unknown, 606 Unchecked, 17.3s Time] [2021-11-16 21:10:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-11-16 21:10:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 302. [2021-11-16 21:10:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 210 states have (on average 1.061904761904762) internal successors, (223), 216 states have internal predecessors, (223), 57 states have call successors, (57), 31 states have call predecessors, (57), 34 states have return successors, (74), 54 states have call predecessors, (74), 55 states have call successors, (74) [2021-11-16 21:10:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 354 transitions. [2021-11-16 21:10:46,580 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 354 transitions. Word has length 118 [2021-11-16 21:10:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:10:46,580 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 354 transitions. [2021-11-16 21:10:46,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.2333333333333334) internal successors, (97), 27 states have internal predecessors, (97), 12 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (30), 13 states have call predecessors, (30), 11 states have call successors, (30) [2021-11-16 21:10:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 354 transitions. [2021-11-16 21:10:46,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-16 21:10:46,581 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:10:46,581 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:10:46,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-16 21:10:46,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-16 21:10:46,795 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:10:46,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:10:46,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1588558461, now seen corresponding path program 1 times [2021-11-16 21:10:46,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:10:46,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288331945] [2021-11-16 21:10:46,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:10:46,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:10:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:10:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:10:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:10:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:10:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:10:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:10:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:10:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:10:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:10:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:10:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:10:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:10:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:10:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 21:10:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 21:10:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-11-16 21:10:48,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:10:48,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288331945] [2021-11-16 21:10:48,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288331945] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:10:48,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:10:48,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-16 21:10:48,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78677976] [2021-11-16 21:10:48,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:10:48,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 21:10:48,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:10:48,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 21:10:48,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:10:48,621 INFO L87 Difference]: Start difference. First operand 302 states and 354 transitions. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 21:10:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:10:56,344 INFO L93 Difference]: Finished difference Result 310 states and 362 transitions. [2021-11-16 21:10:56,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 21:10:56,344 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2021-11-16 21:10:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:10:56,346 INFO L225 Difference]: With dead ends: 310 [2021-11-16 21:10:56,346 INFO L226 Difference]: Without dead ends: 308 [2021-11-16 21:10:56,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-11-16 21:10:56,346 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 74 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-16 21:10:56,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 774 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2021-11-16 21:10:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-11-16 21:10:56,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 298. [2021-11-16 21:10:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 207 states have (on average 1.0628019323671498) internal successors, (220), 212 states have internal predecessors, (220), 57 states have call successors, (57), 31 states have call predecessors, (57), 33 states have return successors, (73), 54 states have call predecessors, (73), 55 states have call successors, (73) [2021-11-16 21:10:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 350 transitions. [2021-11-16 21:10:56,364 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 350 transitions. Word has length 120 [2021-11-16 21:10:56,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:10:56,365 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 350 transitions. [2021-11-16 21:10:56,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 21:10:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 350 transitions. [2021-11-16 21:10:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-16 21:10:56,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:10:56,366 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:10:56,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-16 21:10:56,366 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:10:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:10:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1324049691, now seen corresponding path program 1 times [2021-11-16 21:10:56,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:10:56,367 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058714674] [2021-11-16 21:10:56,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:10:56,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:10:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:57,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:10:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:10:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:57,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:10:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:57,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:10:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:57,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:10:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:59,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:10:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:59,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:10:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:59,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:10:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:59,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:10:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:59,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:10:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:59,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:10:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:59,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:10:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:59,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:10:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:59,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 21:10:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:59,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 21:10:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:59,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-16 21:10:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:10:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-11-16 21:10:59,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:10:59,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058714674] [2021-11-16 21:10:59,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058714674] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:10:59,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:10:59,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-16 21:10:59,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001724629] [2021-11-16 21:10:59,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:10:59,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 21:10:59,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:10:59,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 21:10:59,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:10:59,140 INFO L87 Difference]: Start difference. First operand 298 states and 350 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 7 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2021-11-16 21:11:00,797 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:11:02,046 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:11:03,783 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:11:05,298 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:11:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:11:13,970 INFO L93 Difference]: Finished difference Result 329 states and 393 transitions. [2021-11-16 21:11:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-16 21:11:13,970 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 7 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 124 [2021-11-16 21:11:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:11:13,971 INFO L225 Difference]: With dead ends: 329 [2021-11-16 21:11:13,972 INFO L226 Difference]: Without dead ends: 218 [2021-11-16 21:11:13,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-11-16 21:11:13,972 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 62 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2021-11-16 21:11:13,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 436 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2021-11-16 21:11:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-16 21:11:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2021-11-16 21:11:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 139 states have (on average 1.064748201438849) internal successors, (148), 142 states have internal predecessors, (148), 51 states have call successors, (51), 20 states have call predecessors, (51), 22 states have return successors, (66), 50 states have call predecessors, (66), 48 states have call successors, (66) [2021-11-16 21:11:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 265 transitions. [2021-11-16 21:11:13,986 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 265 transitions. Word has length 124 [2021-11-16 21:11:13,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:11:13,986 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 265 transitions. [2021-11-16 21:11:13,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 7 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2021-11-16 21:11:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 265 transitions. [2021-11-16 21:11:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-16 21:11:13,987 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:11:13,987 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:11:13,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-16 21:11:13,988 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:11:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:11:13,988 INFO L85 PathProgramCache]: Analyzing trace with hash 73196301, now seen corresponding path program 1 times [2021-11-16 21:11:13,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:11:13,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161971118] [2021-11-16 21:11:13,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:11:13,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:11:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:15,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:11:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:15,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:11:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:15,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:11:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:15,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:11:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:15,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:11:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:15,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:11:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:15,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:11:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:15,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 21:11:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:16,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 21:11:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:16,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 21:11:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:16,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 21:11:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 21:11:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:16,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 21:11:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:16,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:11:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:17,858 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 34 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-11-16 21:11:17,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:11:17,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161971118] [2021-11-16 21:11:17,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161971118] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:11:17,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164282450] [2021-11-16 21:11:17,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:11:17,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:11:17,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:11:17,861 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:11:17,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-16 21:11:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:18,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 2663 conjuncts, 73 conjunts are in the unsatisfiable core [2021-11-16 21:11:18,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:11:18,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-16 21:11:20,485 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-16 21:11:20,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-16 21:11:21,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-11-16 21:11:23,864 INFO L354 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2021-11-16 21:11:23,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2021-11-16 21:11:24,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 18 [2021-11-16 21:11:27,223 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-11-16 21:11:27,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 22 [2021-11-16 21:11:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 42 proven. 65 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-16 21:11:50,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:11:53,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164282450] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:11:53,378 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 21:11:53,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2021-11-16 21:11:53,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739319616] [2021-11-16 21:11:53,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 21:11:53,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-16 21:11:53,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:11:53,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-16 21:11:53,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1732, Unknown=1, NotChecked=0, Total=1892 [2021-11-16 21:11:53,379 INFO L87 Difference]: Start difference. First operand 213 states and 265 transitions. Second operand has 38 states, 37 states have (on average 3.945945945945946) internal successors, (146), 34 states have internal predecessors, (146), 16 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (28), 15 states have call predecessors, (28), 14 states have call successors, (28) [2021-11-16 21:11:55,340 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:12:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:12:17,321 INFO L93 Difference]: Finished difference Result 336 states and 400 transitions. [2021-11-16 21:12:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-16 21:12:17,322 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.945945945945946) internal successors, (146), 34 states have internal predecessors, (146), 16 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (28), 15 states have call predecessors, (28), 14 states have call successors, (28) Word has length 129 [2021-11-16 21:12:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:12:17,323 INFO L225 Difference]: With dead ends: 336 [2021-11-16 21:12:17,323 INFO L226 Difference]: Without dead ends: 277 [2021-11-16 21:12:17,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 164 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1714 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=382, Invalid=4173, Unknown=1, NotChecked=0, Total=4556 [2021-11-16 21:12:17,325 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 170 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 710 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2021-11-16 21:12:17,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 1291 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1213 Invalid, 0 Unknown, 710 Unchecked, 13.5s Time] [2021-11-16 21:12:17,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-11-16 21:12:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2021-11-16 21:12:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 173 states have (on average 1.0635838150289016) internal successors, (184), 176 states have internal predecessors, (184), 53 states have call successors, (53), 27 states have call predecessors, (53), 29 states have return successors, (67), 52 states have call predecessors, (67), 50 states have call successors, (67) [2021-11-16 21:12:17,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 304 transitions. [2021-11-16 21:12:17,342 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 304 transitions. Word has length 129 [2021-11-16 21:12:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:12:17,342 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 304 transitions. [2021-11-16 21:12:17,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.945945945945946) internal successors, (146), 34 states have internal predecessors, (146), 16 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (28), 15 states have call predecessors, (28), 14 states have call successors, (28) [2021-11-16 21:12:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 304 transitions. [2021-11-16 21:12:17,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-16 21:12:17,343 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:12:17,343 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:12:17,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-16 21:12:17,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:12:17,564 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:12:17,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:12:17,564 INFO L85 PathProgramCache]: Analyzing trace with hash 212748628, now seen corresponding path program 1 times [2021-11-16 21:12:17,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:12:17,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851260419] [2021-11-16 21:12:17,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:12:17,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:12:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:17,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:12:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:17,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:12:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:18,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:12:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:18,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:12:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:18,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:12:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:18,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:12:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:18,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:12:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:18,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 21:12:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:18,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 21:12:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:18,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 21:12:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:18,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 21:12:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:18,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 21:12:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:18,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 21:12:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:18,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:12:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-11-16 21:12:19,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:12:19,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851260419] [2021-11-16 21:12:19,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851260419] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:12:19,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:12:19,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-16 21:12:19,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684666099] [2021-11-16 21:12:19,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:12:19,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 21:12:19,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:12:19,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 21:12:19,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:12:19,364 INFO L87 Difference]: Start difference. First operand 256 states and 304 transitions. Second operand has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2021-11-16 21:12:20,594 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:12:22,408 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:12:24,486 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:12:29,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:12:29,674 INFO L93 Difference]: Finished difference Result 266 states and 315 transitions. [2021-11-16 21:12:29,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 21:12:29,674 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 131 [2021-11-16 21:12:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:12:29,675 INFO L225 Difference]: With dead ends: 266 [2021-11-16 21:12:29,675 INFO L226 Difference]: Without dead ends: 264 [2021-11-16 21:12:29,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-11-16 21:12:29,678 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 75 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:12:29,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 802 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 456 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2021-11-16 21:12:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-16 21:12:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2021-11-16 21:12:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 176 states have (on average 1.0625) internal successors, (187), 179 states have internal predecessors, (187), 55 states have call successors, (55), 28 states have call predecessors, (55), 30 states have return successors, (69), 54 states have call predecessors, (69), 52 states have call successors, (69) [2021-11-16 21:12:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 311 transitions. [2021-11-16 21:12:29,695 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 311 transitions. Word has length 131 [2021-11-16 21:12:29,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:12:29,695 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 311 transitions. [2021-11-16 21:12:29,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2021-11-16 21:12:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 311 transitions. [2021-11-16 21:12:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-11-16 21:12:29,697 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:12:29,697 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:12:29,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-16 21:12:29,697 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:12:29,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:12:29,697 INFO L85 PathProgramCache]: Analyzing trace with hash 400449954, now seen corresponding path program 1 times [2021-11-16 21:12:29,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:12:29,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495743946] [2021-11-16 21:12:29,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:12:29,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:12:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:31,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:12:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:31,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:12:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:31,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:12:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:32,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:12:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:32,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:12:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:32,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:12:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:32,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:12:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:32,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 21:12:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:32,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 21:12:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:32,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 21:12:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:32,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 21:12:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:32,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 21:12:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:32,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 21:12:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:32,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-16 21:12:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:32,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 21:12:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:12:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-11-16 21:12:32,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:12:32,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495743946] [2021-11-16 21:12:32,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495743946] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:12:32,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635069856] [2021-11-16 21:12:32,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:12:32,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:12:32,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:12:32,956 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:12:32,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process Killed by 15