./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_trim_pred_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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_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 2fd96106837ff3ee9325c248fea6969b94a5a1f2cee078fd159398f70369aafc --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 22:21:04,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:21:04,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:21:04,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:21:04,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:21:04,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:21:04,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:21:04,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:21:04,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:21:04,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:21:04,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:21:04,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:21:04,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:21:04,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:21:04,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:21:04,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:21:04,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:21:04,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:21:04,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:21:04,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:21:04,422 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:21:04,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:21:04,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:21:04,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:21:04,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:21:04,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:21:04,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:21:04,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:21:04,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:21:04,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:21:04,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:21:04,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:21:04,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:21:04,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:21:04,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:21:04,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:21:04,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:21:04,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:21:04,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:21:04,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:21:04,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:21:04,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:21:04,437 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:21:04,456 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:21:04,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:21:04,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:21:04,457 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:21:04,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:21:04,458 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:21:04,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:21:04,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:21:04,459 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:21:04,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:21:04,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:21:04,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:21:04,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:21:04,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:21:04,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:21:04,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:21:04,461 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:21:04,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:21:04,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:21:04,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:21:04,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:21:04,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:21:04,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:21:04,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:21:04,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:21:04,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:21:04,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:21:04,464 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:21:04,464 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:21:04,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:21:04,464 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 -> 2fd96106837ff3ee9325c248fea6969b94a5a1f2cee078fd159398f70369aafc [2022-07-22 22:21:04,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:21:04,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:21:04,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:21:04,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:21:04,710 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:21:04,711 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_trim_pred_harness.i [2022-07-22 22:21:04,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9d4a2ad/4f5ba672fad74a70b3c57f590ffcd0f8/FLAG4b1ede328 [2022-07-22 22:21:05,569 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:21:05,570 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_trim_pred_harness.i [2022-07-22 22:21:05,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9d4a2ad/4f5ba672fad74a70b3c57f590ffcd0f8/FLAG4b1ede328 [2022-07-22 22:21:05,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9d4a2ad/4f5ba672fad74a70b3c57f590ffcd0f8 [2022-07-22 22:21:05,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:21:05,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:21:05,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:21:05,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:21:05,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:21:05,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:21:05" (1/1) ... [2022-07-22 22:21:05,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@143c7eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:21:05, skipping insertion in model container [2022-07-22 22:21:05,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:21:05" (1/1) ... [2022-07-22 22:21:05,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:21:05,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:21:06,097 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_trim_pred_harness.i[4499,4512] [2022-07-22 22:21:06,103 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_trim_pred_harness.i[4559,4572] [2022-07-22 22:21:06,800 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:06,801 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:06,802 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:06,802 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:06,803 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:06,813 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:06,814 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:06,816 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:06,816 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,056 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:21:07,057 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:21:07,058 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:21:07,059 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:21:07,060 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:21:07,061 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:21:07,061 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:21:07,062 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:21:07,062 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:21:07,063 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:21:07,180 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:21:07,293 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,294 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:21:07,431 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:21:07,455 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_trim_pred_harness.i[4499,4512] [2022-07-22 22:21:07,457 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_trim_pred_harness.i[4559,4572] [2022-07-22 22:21:07,504 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,505 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,506 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,506 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,513 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,526 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,528 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,531 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,532 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,564 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:21:07,565 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:21:07,566 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:21:07,566 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:21:07,567 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:21:07,567 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:21:07,568 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:21:07,568 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:21:07,569 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:21:07,571 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:21:07,593 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:21:07,656 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,656 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:21:07,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:21:07,858 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:21:07,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:21:07 WrapperNode [2022-07-22 22:21:07,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:21:07,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:21:07,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:21:07,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:21:07,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:21:07" (1/1) ... [2022-07-22 22:21:07,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:21:07" (1/1) ... [2022-07-22 22:21:08,049 INFO L137 Inliner]: procedures = 690, calls = 2620, calls flagged for inlining = 62, calls inlined = 10, statements flattened = 894 [2022-07-22 22:21:08,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:21:08,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:21:08,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:21:08,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:21:08,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:21:07" (1/1) ... [2022-07-22 22:21:08,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:21:07" (1/1) ... [2022-07-22 22:21:08,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:21:07" (1/1) ... [2022-07-22 22:21:08,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:21:07" (1/1) ... [2022-07-22 22:21:08,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:21:07" (1/1) ... [2022-07-22 22:21:08,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:21:07" (1/1) ... [2022-07-22 22:21:08,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:21:07" (1/1) ... [2022-07-22 22:21:08,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:21:08,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:21:08,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:21:08,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:21:08,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:21:07" (1/1) ... [2022-07-22 22:21:08,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:21:08,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:08,161 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) [2022-07-22 22:21:08,179 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 [2022-07-22 22:21:08,197 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-22 22:21:08,198 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-22 22:21:08,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 22:21:08,198 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-22 22:21:08,199 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-22 22:21:08,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:21:08,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 22:21:08,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 22:21:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_left_trim_pred [2022-07-22 22:21:08,200 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_left_trim_pred [2022-07-22 22:21:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:21:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:21:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 22:21:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:21:08,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:21:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-22 22:21:08,202 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-22 22:21:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-22 22:21:08,203 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-22 22:21:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 22:21:08,203 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 22:21:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 22:21:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 22:21:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:21:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~uint8_t~0~TO~int [2022-07-22 22:21:08,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~uint8_t~0~TO~int [2022-07-22 22:21:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 22:21:08,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:21:08,496 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:21:08,498 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:21:09,441 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:21:09,449 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:21:09,450 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 22:21:09,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:21:09 BoogieIcfgContainer [2022-07-22 22:21:09,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:21:09,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:21:09,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:21:09,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:21:09,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:21:05" (1/3) ... [2022-07-22 22:21:09,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85cfc6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:21:09, skipping insertion in model container [2022-07-22 22:21:09,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:21:07" (2/3) ... [2022-07-22 22:21:09,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85cfc6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:21:09, skipping insertion in model container [2022-07-22 22:21:09,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:21:09" (3/3) ... [2022-07-22 22:21:09,462 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_trim_pred_harness.i [2022-07-22 22:21:09,475 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:21:09,475 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:21:09,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:21:09,538 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7bbd67a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6cb92fc2 [2022-07-22 22:21:09,539 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:21:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 78 states have internal predecessors, (95), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-22 22:21:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-22 22:21:09,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:09,554 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-22 22:21:09,555 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:09,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:09,560 INFO L85 PathProgramCache]: Analyzing trace with hash -484495775, now seen corresponding path program 1 times [2022-07-22 22:21:09,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:09,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815322997] [2022-07-22 22:21:09,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:09,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:21:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:21:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 22:21:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:21:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:21:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:21:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 22:21:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-22 22:21:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-22 22:21:10,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:10,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815322997] [2022-07-22 22:21:10,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815322997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:10,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:21:10,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 22:21:10,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260891630] [2022-07-22 22:21:10,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:10,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 22:21:10,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:10,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 22:21:10,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 22:21:10,355 INFO L87 Difference]: Start difference. First operand has 124 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 78 states have internal predecessors, (95), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:21:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:10,417 INFO L93 Difference]: Finished difference Result 244 states and 355 transitions. [2022-07-22 22:21:10,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 22:21:10,420 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2022-07-22 22:21:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:10,431 INFO L225 Difference]: With dead ends: 244 [2022-07-22 22:21:10,431 INFO L226 Difference]: Without dead ends: 115 [2022-07-22 22:21:10,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 22:21:10,445 INFO L413 NwaCegarLoop]: 165 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, 165 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 [2022-07-22 22:21:10,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:21:10,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-22 22:21:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-07-22 22:21:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 71 states have internal predecessors, (82), 37 states have call successors, (37), 8 states have call predecessors, (37), 7 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-22 22:21:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2022-07-22 22:21:10,513 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 79 [2022-07-22 22:21:10,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:10,513 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2022-07-22 22:21:10,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:21:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2022-07-22 22:21:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-22 22:21:10,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:10,523 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-22 22:21:10,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 22:21:10,524 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:10,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1850978430, now seen corresponding path program 1 times [2022-07-22 22:21:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:10,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459333358] [2022-07-22 22:21:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:10,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:21:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:21:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 22:21:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:21:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:21:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:21:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 22:21:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:21:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-22 22:21:10,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:10,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459333358] [2022-07-22 22:21:10,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459333358] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:10,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653637569] [2022-07-22 22:21:10,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:10,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:10,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:10,947 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) [2022-07-22 22:21:10,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 22:21:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:11,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 2552 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 22:21:11,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-22 22:21:11,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:21:11,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653637569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:11,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:21:11,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-07-22 22:21:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925679563] [2022-07-22 22:21:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:11,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:21:11,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:11,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:21:11,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:21:11,587 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:21:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:11,792 INFO L93 Difference]: Finished difference Result 213 states and 298 transitions. [2022-07-22 22:21:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:21:11,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 81 [2022-07-22 22:21:11,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:11,801 INFO L225 Difference]: With dead ends: 213 [2022-07-22 22:21:11,801 INFO L226 Difference]: Without dead ends: 118 [2022-07-22 22:21:11,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:21:11,808 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 171 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:11,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 294 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:21:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-22 22:21:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-22 22:21:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 74 states have internal predecessors, (84), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (45), 35 states have call predecessors, (45), 35 states have call successors, (45) [2022-07-22 22:21:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2022-07-22 22:21:11,836 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 81 [2022-07-22 22:21:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:11,837 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2022-07-22 22:21:11,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:21:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2022-07-22 22:21:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-22 22:21:11,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:11,840 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 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] [2022-07-22 22:21:11,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 22:21:12,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:12,068 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1473940729, now seen corresponding path program 1 times [2022-07-22 22:21:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:12,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978834340] [2022-07-22 22:21:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:12,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:12,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:12,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:12,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:21:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:12,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:21:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:12,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 22:21:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:12,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:21:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:12,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:21:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:12,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 22:21:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:12,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:21:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:12,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 22:21:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-22 22:21:12,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:12,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978834340] [2022-07-22 22:21:12,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978834340] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:12,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12364149] [2022-07-22 22:21:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:12,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:12,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:12,560 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) [2022-07-22 22:21:12,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 22:21:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:13,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 2557 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 22:21:13,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 22:21:13,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:21:13,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12364149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:13,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:21:13,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-07-22 22:21:13,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046582346] [2022-07-22 22:21:13,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:13,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:21:13,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:13,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:21:13,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:21:13,173 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 22:21:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:13,426 INFO L93 Difference]: Finished difference Result 208 states and 295 transitions. [2022-07-22 22:21:13,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:21:13,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 83 [2022-07-22 22:21:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:13,428 INFO L225 Difference]: With dead ends: 208 [2022-07-22 22:21:13,428 INFO L226 Difference]: Without dead ends: 118 [2022-07-22 22:21:13,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:21:13,430 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 189 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:13,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 469 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:21:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-22 22:21:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-22 22:21:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 74 states have internal predecessors, (84), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (43), 35 states have call predecessors, (43), 35 states have call successors, (43) [2022-07-22 22:21:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2022-07-22 22:21:13,442 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 83 [2022-07-22 22:21:13,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:13,443 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2022-07-22 22:21:13,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 22:21:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2022-07-22 22:21:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-22 22:21:13,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:13,444 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 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] [2022-07-22 22:21:13,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-22 22:21:13,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-22 22:21:13,664 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:13,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:13,665 INFO L85 PathProgramCache]: Analyzing trace with hash -346545804, now seen corresponding path program 2 times [2022-07-22 22:21:13,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:13,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021297158] [2022-07-22 22:21:13,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:13,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:13,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:13,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:13,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:13,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:21:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:13,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:21:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:13,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:21:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:13,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:21:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:13,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:21:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:14,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:21:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:14,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 22:21:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 22:21:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-22 22:21:14,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:14,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021297158] [2022-07-22 22:21:14,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021297158] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:14,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240408847] [2022-07-22 22:21:14,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 22:21:14,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:14,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:14,030 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) [2022-07-22 22:21:14,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 22:21:14,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 22:21:14,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 22:21:14,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 2562 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 22:21:14,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-22 22:21:14,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:21:14,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240408847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:14,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:21:14,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-22 22:21:14,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871888797] [2022-07-22 22:21:14,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:14,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:21:14,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:14,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:21:14,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:21:14,726 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 22:21:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:15,093 INFO L93 Difference]: Finished difference Result 201 states and 281 transitions. [2022-07-22 22:21:15,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:21:15,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 85 [2022-07-22 22:21:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:15,097 INFO L225 Difference]: With dead ends: 201 [2022-07-22 22:21:15,098 INFO L226 Difference]: Without dead ends: 118 [2022-07-22 22:21:15,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2022-07-22 22:21:15,102 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 196 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:15,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 613 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:21:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-22 22:21:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-22 22:21:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 74 states have internal predecessors, (84), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (41), 35 states have call predecessors, (41), 35 states have call successors, (41) [2022-07-22 22:21:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 162 transitions. [2022-07-22 22:21:15,132 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 162 transitions. Word has length 85 [2022-07-22 22:21:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:15,132 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 162 transitions. [2022-07-22 22:21:15,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 22:21:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 162 transitions. [2022-07-22 22:21:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-22 22:21:15,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:15,136 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 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] [2022-07-22 22:21:15,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 22:21:15,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:15,349 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:15,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:15,350 INFO L85 PathProgramCache]: Analyzing trace with hash 625417492, now seen corresponding path program 1 times [2022-07-22 22:21:15,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:15,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390721186] [2022-07-22 22:21:15,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:15,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:15,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:15,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:15,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:15,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:21:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:15,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:21:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:21:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:15,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:21:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:15,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:21:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:15,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 22:21:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:15,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:21:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:15,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 22:21:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-22 22:21:15,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:15,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390721186] [2022-07-22 22:21:15,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390721186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:15,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:21:15,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:21:15,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253693838] [2022-07-22 22:21:15,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:15,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:21:15,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:15,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:21:15,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:21:15,700 INFO L87 Difference]: Start difference. First operand 118 states and 162 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-22 22:21:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:15,779 INFO L93 Difference]: Finished difference Result 130 states and 185 transitions. [2022-07-22 22:21:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:21:15,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2022-07-22 22:21:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:15,781 INFO L225 Difference]: With dead ends: 130 [2022-07-22 22:21:15,781 INFO L226 Difference]: Without dead ends: 128 [2022-07-22 22:21:15,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:21:15,782 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 16 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:15,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1057 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:21:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-22 22:21:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-07-22 22:21:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.1538461538461537) internal successors, (90), 81 states have internal predecessors, (90), 38 states have call successors, (38), 9 states have call predecessors, (38), 10 states have return successors, (54), 36 states have call predecessors, (54), 36 states have call successors, (54) [2022-07-22 22:21:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 182 transitions. [2022-07-22 22:21:15,793 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 182 transitions. Word has length 89 [2022-07-22 22:21:15,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:15,793 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 182 transitions. [2022-07-22 22:21:15,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-22 22:21:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 182 transitions. [2022-07-22 22:21:15,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-22 22:21:15,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:15,795 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 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] [2022-07-22 22:21:15,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 22:21:15,795 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash 852132828, now seen corresponding path program 1 times [2022-07-22 22:21:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:15,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209300327] [2022-07-22 22:21:15,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:15,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:21:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:21:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:21:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:21:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:21:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 22:21:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:21:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 22:21:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-22 22:21:16,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:16,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209300327] [2022-07-22 22:21:16,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209300327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:16,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:21:16,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:21:16,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635326776] [2022-07-22 22:21:16,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:16,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:21:16,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:16,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:21:16,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:21:16,172 INFO L87 Difference]: Start difference. First operand 127 states and 182 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:21:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:16,594 INFO L93 Difference]: Finished difference Result 225 states and 333 transitions. [2022-07-22 22:21:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:21:16,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2022-07-22 22:21:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:16,596 INFO L225 Difference]: With dead ends: 225 [2022-07-22 22:21:16,596 INFO L226 Difference]: Without dead ends: 148 [2022-07-22 22:21:16,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:21:16,598 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 36 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:16,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 657 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:21:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-22 22:21:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2022-07-22 22:21:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 82 states have (on average 1.170731707317073) internal successors, (96), 86 states have internal predecessors, (96), 41 states have call successors, (41), 9 states have call predecessors, (41), 10 states have return successors, (58), 38 states have call predecessors, (58), 39 states have call successors, (58) [2022-07-22 22:21:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 195 transitions. [2022-07-22 22:21:16,616 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 195 transitions. Word has length 93 [2022-07-22 22:21:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:16,616 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 195 transitions. [2022-07-22 22:21:16,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:21:16,617 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 195 transitions. [2022-07-22 22:21:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-22 22:21:16,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:16,618 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 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] [2022-07-22 22:21:16,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 22:21:16,618 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:16,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:16,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1211514462, now seen corresponding path program 1 times [2022-07-22 22:21:16,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:16,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957966817] [2022-07-22 22:21:16,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:16,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:21:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:21:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:21:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:21:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:21:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 22:21:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:21:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 22:21:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-22 22:21:16,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:16,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957966817] [2022-07-22 22:21:16,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957966817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:16,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:21:16,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 22:21:16,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102498841] [2022-07-22 22:21:16,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:16,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:21:16,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:16,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:21:16,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:21:16,865 INFO L87 Difference]: Start difference. First operand 134 states and 195 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:21:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:16,880 INFO L93 Difference]: Finished difference Result 223 states and 324 transitions. [2022-07-22 22:21:16,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:21:16,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2022-07-22 22:21:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:16,884 INFO L225 Difference]: With dead ends: 223 [2022-07-22 22:21:16,884 INFO L226 Difference]: Without dead ends: 135 [2022-07-22 22:21:16,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:21:16,885 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 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 [2022-07-22 22:21:16,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:21:16,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-22 22:21:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-07-22 22:21:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 87 states have internal predecessors, (96), 41 states have call successors, (41), 9 states have call predecessors, (41), 10 states have return successors, (58), 38 states have call predecessors, (58), 39 states have call successors, (58) [2022-07-22 22:21:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 195 transitions. [2022-07-22 22:21:16,900 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 195 transitions. Word has length 96 [2022-07-22 22:21:16,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:16,902 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 195 transitions. [2022-07-22 22:21:16,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:21:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 195 transitions. [2022-07-22 22:21:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-22 22:21:16,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:16,903 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 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] [2022-07-22 22:21:16,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 22:21:16,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:16,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash -247569564, now seen corresponding path program 1 times [2022-07-22 22:21:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:16,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096353936] [2022-07-22 22:21:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:16,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:21:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:21:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:21:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:21:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:21:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 22:21:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:21:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:21:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 22:21:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-22 22:21:17,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:17,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096353936] [2022-07-22 22:21:17,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096353936] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:17,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260425202] [2022-07-22 22:21:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:17,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:17,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:17,293 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) [2022-07-22 22:21:17,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 22:21:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:17,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 2612 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-22 22:21:17,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 37 proven. 16 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-22 22:21:18,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:21:19,367 INFO L390 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 26 treesize of output 14 [2022-07-22 22:21:19,407 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-22 22:21:19,407 INFO L390 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 30 treesize of output 25 [2022-07-22 22:21:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-22 22:21:19,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260425202] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:21:19,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:21:19,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 12] total 24 [2022-07-22 22:21:19,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362342826] [2022-07-22 22:21:19,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:21:19,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 22:21:19,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:19,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 22:21:19,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2022-07-22 22:21:19,425 INFO L87 Difference]: Start difference. First operand 135 states and 195 transitions. Second operand has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 22 states have internal predecessors, (110), 9 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) [2022-07-22 22:21:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:21,560 INFO L93 Difference]: Finished difference Result 361 states and 544 transitions. [2022-07-22 22:21:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-22 22:21:21,561 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 22 states have internal predecessors, (110), 9 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) Word has length 99 [2022-07-22 22:21:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:21,564 INFO L225 Difference]: With dead ends: 361 [2022-07-22 22:21:21,565 INFO L226 Difference]: Without dead ends: 258 [2022-07-22 22:21:21,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 191 SyntacticMatches, 23 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2022-07-22 22:21:21,567 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 133 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:21,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 2413 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1856 Invalid, 0 Unknown, 214 Unchecked, 1.5s Time] [2022-07-22 22:21:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-22 22:21:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 202. [2022-07-22 22:21:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 125 states have (on average 1.136) internal successors, (142), 129 states have internal predecessors, (142), 62 states have call successors, (62), 13 states have call predecessors, (62), 14 states have return successors, (84), 59 states have call predecessors, (84), 60 states have call successors, (84) [2022-07-22 22:21:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 288 transitions. [2022-07-22 22:21:21,592 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 288 transitions. Word has length 99 [2022-07-22 22:21:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:21,593 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 288 transitions. [2022-07-22 22:21:21,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 22 states have internal predecessors, (110), 9 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) [2022-07-22 22:21:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 288 transitions. [2022-07-22 22:21:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-22 22:21:21,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:21,595 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:21:21,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-22 22:21:21,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:21,811 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:21,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1338258892, now seen corresponding path program 1 times [2022-07-22 22:21:21,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:21,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415008277] [2022-07-22 22:21:21,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:21,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:21,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:21,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:21,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:21:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:21,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 22:21:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:21:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:21:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 22:21:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 22:21:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 22:21:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 22:21:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-22 22:21:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-22 22:21:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-22 22:21:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:22,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415008277] [2022-07-22 22:21:22,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415008277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:22,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:21:22,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:21:22,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028875876] [2022-07-22 22:21:22,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:22,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:21:22,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:22,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:21:22,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:21:22,064 INFO L87 Difference]: Start difference. First operand 202 states and 288 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-22 22:21:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:22,116 INFO L93 Difference]: Finished difference Result 280 states and 398 transitions. [2022-07-22 22:21:22,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:21:22,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2022-07-22 22:21:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:22,119 INFO L225 Difference]: With dead ends: 280 [2022-07-22 22:21:22,119 INFO L226 Difference]: Without dead ends: 202 [2022-07-22 22:21:22,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:21:22,121 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 18 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:22,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 522 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:21:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-22 22:21:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-07-22 22:21:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 125 states have (on average 1.136) internal successors, (142), 129 states have internal predecessors, (142), 62 states have call successors, (62), 13 states have call predecessors, (62), 14 states have return successors, (81), 59 states have call predecessors, (81), 60 states have call successors, (81) [2022-07-22 22:21:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 285 transitions. [2022-07-22 22:21:22,140 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 285 transitions. Word has length 105 [2022-07-22 22:21:22,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:22,140 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 285 transitions. [2022-07-22 22:21:22,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-22 22:21:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 285 transitions. [2022-07-22 22:21:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-22 22:21:22,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:22,142 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2022-07-22 22:21:22,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 22:21:22,143 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:22,143 INFO L85 PathProgramCache]: Analyzing trace with hash 762751521, now seen corresponding path program 1 times [2022-07-22 22:21:22,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:22,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731039969] [2022-07-22 22:21:22,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:22,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:21:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:21:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:21:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:21:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:21:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 22:21:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:21:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 22:21:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:21:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-22 22:21:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-22 22:21:22,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:22,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731039969] [2022-07-22 22:21:22,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731039969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:22,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:21:22,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:21:22,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14134469] [2022-07-22 22:21:22,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:22,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:21:22,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:22,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:21:22,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:21:22,459 INFO L87 Difference]: Start difference. First operand 202 states and 285 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-22 22:21:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:22,540 INFO L93 Difference]: Finished difference Result 210 states and 293 transitions. [2022-07-22 22:21:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:21:22,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 103 [2022-07-22 22:21:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:22,543 INFO L225 Difference]: With dead ends: 210 [2022-07-22 22:21:22,543 INFO L226 Difference]: Without dead ends: 208 [2022-07-22 22:21:22,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:21:22,544 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 16 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:22,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1065 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:21:22,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-22 22:21:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2022-07-22 22:21:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 128 states have (on average 1.1328125) internal successors, (145), 132 states have internal predecessors, (145), 63 states have call successors, (63), 14 states have call predecessors, (63), 15 states have return successors, (82), 60 states have call predecessors, (82), 61 states have call successors, (82) [2022-07-22 22:21:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 290 transitions. [2022-07-22 22:21:22,562 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 290 transitions. Word has length 103 [2022-07-22 22:21:22,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:22,563 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 290 transitions. [2022-07-22 22:21:22,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-22 22:21:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 290 transitions. [2022-07-22 22:21:22,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 22:21:22,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:22,565 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 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] [2022-07-22 22:21:22,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 22:21:22,565 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:22,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:22,565 INFO L85 PathProgramCache]: Analyzing trace with hash -912199724, now seen corresponding path program 2 times [2022-07-22 22:21:22,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:22,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547188196] [2022-07-22 22:21:22,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:22,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:21:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 22:21:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:21:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:21:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 22:21:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:21:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:21:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 22:21:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-22 22:21:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-22 22:21:22,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:22,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547188196] [2022-07-22 22:21:22,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547188196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:22,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823425972] [2022-07-22 22:21:22,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 22:21:22,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:22,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:22,840 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) [2022-07-22 22:21:22,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 22:21:24,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 22:21:24,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 22:21:24,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 2636 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-22 22:21:24,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 22:21:24,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:21:24,945 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-22 22:21:24,945 INFO L390 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 20 treesize of output 19 [2022-07-22 22:21:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-22 22:21:24,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823425972] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:21:24,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:21:24,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 25 [2022-07-22 22:21:24,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125748766] [2022-07-22 22:21:24,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:21:24,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-22 22:21:24,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:24,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-22 22:21:24,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-07-22 22:21:24,958 INFO L87 Difference]: Start difference. First operand 207 states and 290 transitions. Second operand has 25 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 24 states have internal predecessors, (104), 8 states have call successors, (28), 3 states have call predecessors, (28), 8 states have return successors, (27), 6 states have call predecessors, (27), 8 states have call successors, (27) [2022-07-22 22:21:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:27,076 INFO L93 Difference]: Finished difference Result 400 states and 590 transitions. [2022-07-22 22:21:27,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-22 22:21:27,082 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 24 states have internal predecessors, (104), 8 states have call successors, (28), 3 states have call predecessors, (28), 8 states have return successors, (27), 6 states have call predecessors, (27), 8 states have call successors, (27) Word has length 107 [2022-07-22 22:21:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:27,084 INFO L225 Difference]: With dead ends: 400 [2022-07-22 22:21:27,084 INFO L226 Difference]: Without dead ends: 269 [2022-07-22 22:21:27,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=290, Invalid=2062, Unknown=0, NotChecked=0, Total=2352 [2022-07-22 22:21:27,087 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 130 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:27,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 2334 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2071 Invalid, 0 Unknown, 242 Unchecked, 1.5s Time] [2022-07-22 22:21:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-22 22:21:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2022-07-22 22:21:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 139 states have (on average 1.1223021582733812) internal successors, (156), 144 states have internal predecessors, (156), 64 states have call successors, (64), 16 states have call predecessors, (64), 17 states have return successors, (95), 60 states have call predecessors, (95), 62 states have call successors, (95) [2022-07-22 22:21:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2022-07-22 22:21:27,109 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 107 [2022-07-22 22:21:27,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:27,109 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2022-07-22 22:21:27,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 24 states have internal predecessors, (104), 8 states have call successors, (28), 3 states have call predecessors, (28), 8 states have return successors, (27), 6 states have call predecessors, (27), 8 states have call successors, (27) [2022-07-22 22:21:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2022-07-22 22:21:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-22 22:21:27,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:27,111 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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] [2022-07-22 22:21:27,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 22:21:27,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-22 22:21:27,332 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:27,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:27,332 INFO L85 PathProgramCache]: Analyzing trace with hash 411830111, now seen corresponding path program 1 times [2022-07-22 22:21:27,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:27,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146906957] [2022-07-22 22:21:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:27,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:21:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:21:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 22:21:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 22:21:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:21:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:21:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 22:21:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-22 22:21:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 22:21:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-22 22:21:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-22 22:21:27,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:27,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146906957] [2022-07-22 22:21:27,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146906957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:27,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582212182] [2022-07-22 22:21:27,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:27,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:27,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:27,816 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) [2022-07-22 22:21:27,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 22:21:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:28,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 2669 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 22:21:28,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-22 22:21:28,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:21:28,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582212182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:28,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:21:28,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-22 22:21:28,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690638451] [2022-07-22 22:21:28,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:28,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:21:28,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:28,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:21:28,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:21:28,361 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 22:21:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:28,519 INFO L93 Difference]: Finished difference Result 358 states and 508 transitions. [2022-07-22 22:21:28,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:21:28,519 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2022-07-22 22:21:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:28,521 INFO L225 Difference]: With dead ends: 358 [2022-07-22 22:21:28,521 INFO L226 Difference]: Without dead ends: 221 [2022-07-22 22:21:28,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-07-22 22:21:28,523 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 12 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:28,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1119 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:21:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-22 22:21:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-07-22 22:21:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 139 states have (on average 1.1223021582733812) internal successors, (156), 144 states have internal predecessors, (156), 64 states have call successors, (64), 16 states have call predecessors, (64), 17 states have return successors, (93), 60 states have call predecessors, (93), 62 states have call successors, (93) [2022-07-22 22:21:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 313 transitions. [2022-07-22 22:21:28,540 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 313 transitions. Word has length 110 [2022-07-22 22:21:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:28,541 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 313 transitions. [2022-07-22 22:21:28,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 22:21:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 313 transitions. [2022-07-22 22:21:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-22 22:21:28,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:28,543 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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] [2022-07-22 22:21:28,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 [2022-07-22 22:21:28,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:28,751 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:28,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:28,752 INFO L85 PathProgramCache]: Analyzing trace with hash -712076360, now seen corresponding path program 1 times [2022-07-22 22:21:28,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:28,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541500420] [2022-07-22 22:21:28,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:28,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:28,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:28,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:28,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:28,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:21:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:28,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:21:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:28,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 22:21:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:29,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 22:21:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:29,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:21:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:29,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:21:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:29,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 22:21:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:29,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 22:21:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-22 22:21:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:29,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:21:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-22 22:21:29,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:29,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541500420] [2022-07-22 22:21:29,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541500420] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:29,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268534786] [2022-07-22 22:21:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:29,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:29,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:29,179 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) [2022-07-22 22:21:29,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 22:21:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:29,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 2679 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 22:21:29,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:29,797 INFO L390 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 15 [2022-07-22 22:21:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 22:21:29,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:21:29,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268534786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:29,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:21:29,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 16 [2022-07-22 22:21:29,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577520386] [2022-07-22 22:21:29,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:29,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:21:29,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:29,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:21:29,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-22 22:21:29,830 INFO L87 Difference]: Start difference. First operand 221 states and 313 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 22:21:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:30,480 INFO L93 Difference]: Finished difference Result 400 states and 602 transitions. [2022-07-22 22:21:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:21:30,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2022-07-22 22:21:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:30,482 INFO L225 Difference]: With dead ends: 400 [2022-07-22 22:21:30,482 INFO L226 Difference]: Without dead ends: 272 [2022-07-22 22:21:30,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-07-22 22:21:30,484 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 110 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:30,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 890 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 436 Invalid, 0 Unknown, 81 Unchecked, 0.5s Time] [2022-07-22 22:21:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-22 22:21:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 225. [2022-07-22 22:21:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 142 states have (on average 1.1126760563380282) internal successors, (158), 147 states have internal predecessors, (158), 64 states have call successors, (64), 17 states have call predecessors, (64), 18 states have return successors, (93), 60 states have call predecessors, (93), 62 states have call successors, (93) [2022-07-22 22:21:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 315 transitions. [2022-07-22 22:21:30,511 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 315 transitions. Word has length 112 [2022-07-22 22:21:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:30,512 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 315 transitions. [2022-07-22 22:21:30,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 22:21:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 315 transitions. [2022-07-22 22:21:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-22 22:21:30,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:30,514 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 22:21:30,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 22:21:30,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:30,727 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:30,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1160869054, now seen corresponding path program 1 times [2022-07-22 22:21:30,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:30,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219551496] [2022-07-22 22:21:30,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:30,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:30,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:30,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:30,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:21:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:30,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 22:21:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:30,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:21:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:30,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:21:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:31,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:21:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 22:21:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:31,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 22:21:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:31,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:21:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:31,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:21:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-22 22:21:31,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:31,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219551496] [2022-07-22 22:21:31,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219551496] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:31,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547152481] [2022-07-22 22:21:31,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:31,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:31,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:31,041 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) [2022-07-22 22:21:31,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 22:21:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:31,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 2668 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-22 22:21:31,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:36,253 INFO L390 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 25 treesize of output 17 [2022-07-22 22:21:36,257 INFO L390 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 21 treesize of output 13 [2022-07-22 22:21:36,260 INFO L390 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 [2022-07-22 22:21:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-22 22:21:36,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:21:36,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547152481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:36,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:21:36,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 21 [2022-07-22 22:21:36,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682223894] [2022-07-22 22:21:36,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:36,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:21:36,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:36,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:21:36,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=358, Unknown=2, NotChecked=0, Total=420 [2022-07-22 22:21:36,303 INFO L87 Difference]: Start difference. First operand 225 states and 315 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-22 22:21:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:39,566 INFO L93 Difference]: Finished difference Result 442 states and 639 transitions. [2022-07-22 22:21:39,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 22:21:39,567 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 115 [2022-07-22 22:21:39,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:39,569 INFO L225 Difference]: With dead ends: 442 [2022-07-22 22:21:39,569 INFO L226 Difference]: Without dead ends: 305 [2022-07-22 22:21:39,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=137, Invalid=672, Unknown=3, NotChecked=0, Total=812 [2022-07-22 22:21:39,571 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 117 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:39,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 806 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 727 Invalid, 0 Unknown, 166 Unchecked, 0.8s Time] [2022-07-22 22:21:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-07-22 22:21:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 262. [2022-07-22 22:21:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 173 states have (on average 1.115606936416185) internal successors, (193), 179 states have internal predecessors, (193), 65 states have call successors, (65), 20 states have call predecessors, (65), 23 states have return successors, (95), 62 states have call predecessors, (95), 63 states have call successors, (95) [2022-07-22 22:21:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 353 transitions. [2022-07-22 22:21:39,594 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 353 transitions. Word has length 115 [2022-07-22 22:21:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:39,595 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 353 transitions. [2022-07-22 22:21:39,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-22 22:21:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 353 transitions. [2022-07-22 22:21:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-22 22:21:39,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:39,597 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 22:21:39,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 22:21:39,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 22:21:39,811 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:39,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1782713024, now seen corresponding path program 1 times [2022-07-22 22:21:39,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:39,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831974478] [2022-07-22 22:21:39,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:39,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:39,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:39,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:39,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:21:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:39,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 22:21:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:21:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:21:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:21:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:40,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 22:21:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:40,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 22:21:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:21:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:40,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:21:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-22 22:21:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:40,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831974478] [2022-07-22 22:21:40,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831974478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:40,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885441809] [2022-07-22 22:21:40,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:40,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:40,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:40,035 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) [2022-07-22 22:21:40,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 22:21:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:40,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 2663 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 22:21:40,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-22 22:21:40,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:21:40,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885441809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:40,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:21:40,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-22 22:21:40,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376069473] [2022-07-22 22:21:40,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:40,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:21:40,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:40,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:21:40,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:21:40,503 INFO L87 Difference]: Start difference. First operand 262 states and 353 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-22 22:21:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:40,538 INFO L93 Difference]: Finished difference Result 422 states and 601 transitions. [2022-07-22 22:21:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:21:40,539 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2022-07-22 22:21:40,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:40,541 INFO L225 Difference]: With dead ends: 422 [2022-07-22 22:21:40,541 INFO L226 Difference]: Without dead ends: 251 [2022-07-22 22:21:40,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:21:40,545 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 6 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 456 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 [2022-07-22 22:21:40,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 456 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:21:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-22 22:21:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2022-07-22 22:21:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 160 states have (on average 1.10625) internal successors, (177), 166 states have internal predecessors, (177), 63 states have call successors, (63), 18 states have call predecessors, (63), 21 states have return successors, (91), 60 states have call predecessors, (91), 61 states have call successors, (91) [2022-07-22 22:21:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 331 transitions. [2022-07-22 22:21:40,568 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 331 transitions. Word has length 115 [2022-07-22 22:21:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:40,568 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 331 transitions. [2022-07-22 22:21:40,568 INFO L496 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-22 22:21:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 331 transitions. [2022-07-22 22:21:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-22 22:21:40,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:40,570 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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, 1] [2022-07-22 22:21:40,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 22:21:40,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 22:21:40,789 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:40,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:40,789 INFO L85 PathProgramCache]: Analyzing trace with hash 929000903, now seen corresponding path program 2 times [2022-07-22 22:21:40,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:40,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793977436] [2022-07-22 22:21:40,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:40,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:21:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 22:21:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:21:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:21:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 22:21:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 22:21:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 22:21:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 22:21:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-22 22:21:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:21:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-22 22:21:41,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:41,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793977436] [2022-07-22 22:21:41,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793977436] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:41,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412094904] [2022-07-22 22:21:41,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 22:21:41,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:41,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:41,216 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) [2022-07-22 22:21:41,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 22:21:41,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 22:21:41,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 22:21:41,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 2701 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 22:21:41,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 114 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 22:21:42,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:21:42,389 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-22 22:21:42,389 INFO L390 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 30 treesize of output 25 [2022-07-22 22:21:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-22 22:21:42,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412094904] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:21:42,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:21:42,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 18 [2022-07-22 22:21:42,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388791850] [2022-07-22 22:21:42,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:21:42,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 22:21:42,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:42,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 22:21:42,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:21:42,415 INFO L87 Difference]: Start difference. First operand 245 states and 331 transitions. Second operand has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 4 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-22 22:21:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:43,843 INFO L93 Difference]: Finished difference Result 496 states and 702 transitions. [2022-07-22 22:21:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 22:21:43,844 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 4 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 118 [2022-07-22 22:21:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:43,847 INFO L225 Difference]: With dead ends: 496 [2022-07-22 22:21:43,847 INFO L226 Difference]: Without dead ends: 365 [2022-07-22 22:21:43,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 247 SyntacticMatches, 14 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2022-07-22 22:21:43,849 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 132 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:43,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1087 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1085 Invalid, 0 Unknown, 230 Unchecked, 0.9s Time] [2022-07-22 22:21:43,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-22 22:21:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 342. [2022-07-22 22:21:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 225 states have internal predecessors, (243), 95 states have call successors, (95), 24 states have call predecessors, (95), 26 states have return successors, (136), 92 states have call predecessors, (136), 93 states have call successors, (136) [2022-07-22 22:21:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 474 transitions. [2022-07-22 22:21:43,879 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 474 transitions. Word has length 118 [2022-07-22 22:21:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:43,879 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 474 transitions. [2022-07-22 22:21:43,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 4 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-22 22:21:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 474 transitions. [2022-07-22 22:21:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-22 22:21:43,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:43,882 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 22:21:43,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 22:21:44,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-22 22:21:44,107 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:44,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:44,108 INFO L85 PathProgramCache]: Analyzing trace with hash -158853761, now seen corresponding path program 1 times [2022-07-22 22:21:44,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:44,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005154779] [2022-07-22 22:21:44,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:44,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:21:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 22:21:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:21:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 22:21:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:21:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:21:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:21:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-22 22:21:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:21:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-22 22:21:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-22 22:21:44,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:44,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005154779] [2022-07-22 22:21:44,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005154779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:44,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784679263] [2022-07-22 22:21:44,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:44,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:44,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:44,457 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) [2022-07-22 22:21:44,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 22:21:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:44,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 2713 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-22 22:21:44,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:44,990 INFO L390 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 [2022-07-22 22:21:44,996 INFO L390 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 [2022-07-22 22:21:45,179 INFO L390 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 15 treesize of output 7 [2022-07-22 22:21:45,184 INFO L390 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 15 treesize of output 7 [2022-07-22 22:21:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-22 22:21:45,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:21:45,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784679263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:45,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:21:45,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-22 22:21:45,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140161995] [2022-07-22 22:21:45,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:45,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:21:45,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:45,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:21:45,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:21:45,211 INFO L87 Difference]: Start difference. First operand 342 states and 474 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-22 22:21:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:45,442 INFO L93 Difference]: Finished difference Result 644 states and 948 transitions. [2022-07-22 22:21:45,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:21:45,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 122 [2022-07-22 22:21:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:45,445 INFO L225 Difference]: With dead ends: 644 [2022-07-22 22:21:45,446 INFO L226 Difference]: Without dead ends: 428 [2022-07-22 22:21:45,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:21:45,448 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 91 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:45,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 811 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 118 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2022-07-22 22:21:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-07-22 22:21:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 352. [2022-07-22 22:21:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 228 states have (on average 1.1008771929824561) internal successors, (251), 234 states have internal predecessors, (251), 96 states have call successors, (96), 25 states have call predecessors, (96), 27 states have return successors, (137), 92 states have call predecessors, (137), 94 states have call successors, (137) [2022-07-22 22:21:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 484 transitions. [2022-07-22 22:21:45,484 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 484 transitions. Word has length 122 [2022-07-22 22:21:45,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:45,484 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 484 transitions. [2022-07-22 22:21:45,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-22 22:21:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 484 transitions. [2022-07-22 22:21:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-22 22:21:45,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:45,487 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2022-07-22 22:21:45,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 22:21:45,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 22:21:45,713 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1460715489, now seen corresponding path program 1 times [2022-07-22 22:21:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:45,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605639014] [2022-07-22 22:21:45,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:45,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:45,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:45,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 22:21:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:45,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:21:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:45,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:21:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:45,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 22:21:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:21:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:45,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:21:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:46,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:21:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:46,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 22:21:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:46,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:21:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:46,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:21:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:46,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:21:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:46,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-22 22:21:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:46,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 22:21:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-22 22:21:46,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:46,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605639014] [2022-07-22 22:21:46,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605639014] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:46,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524336029] [2022-07-22 22:21:46,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:46,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:46,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:46,104 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) [2022-07-22 22:21:46,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 22:21:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:46,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 2750 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 22:21:46,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-22 22:21:46,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:21:46,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524336029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:46,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:21:46,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-22 22:21:46,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064064403] [2022-07-22 22:21:46,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:46,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:21:46,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:46,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:21:46,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:21:46,560 INFO L87 Difference]: Start difference. First operand 352 states and 484 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-22 22:21:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:46,726 INFO L93 Difference]: Finished difference Result 530 states and 729 transitions. [2022-07-22 22:21:46,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:21:46,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 133 [2022-07-22 22:21:46,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:46,729 INFO L225 Difference]: With dead ends: 530 [2022-07-22 22:21:46,730 INFO L226 Difference]: Without dead ends: 329 [2022-07-22 22:21:46,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:21:46,732 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:46,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1128 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:21:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-22 22:21:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 317. [2022-07-22 22:21:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 207 states have (on average 1.1014492753623188) internal successors, (228), 213 states have internal predecessors, (228), 84 states have call successors, (84), 24 states have call predecessors, (84), 25 states have return successors, (119), 79 states have call predecessors, (119), 82 states have call successors, (119) [2022-07-22 22:21:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2022-07-22 22:21:46,763 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 133 [2022-07-22 22:21:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:46,764 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2022-07-22 22:21:46,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-22 22:21:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2022-07-22 22:21:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 22:21:46,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:46,766 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:21:46,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-22 22:21:46,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-22 22:21:46,979 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1001276614, now seen corresponding path program 2 times [2022-07-22 22:21:46,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:46,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352372704] [2022-07-22 22:21:46,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:46,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 22:21:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:21:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:21:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 22:21:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:21:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:21:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:21:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:21:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 22:21:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 22:21:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:21:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:21:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:21:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-22 22:21:47,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:47,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352372704] [2022-07-22 22:21:47,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352372704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:47,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:21:47,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-22 22:21:47,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227272788] [2022-07-22 22:21:47,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:47,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 22:21:47,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 22:21:47,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:21:47,830 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 16 states have internal predecessors, (58), 8 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-22 22:21:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:49,482 INFO L93 Difference]: Finished difference Result 533 states and 802 transitions. [2022-07-22 22:21:49,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 22:21:49,484 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 16 states have internal predecessors, (58), 8 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) Word has length 135 [2022-07-22 22:21:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:49,488 INFO L225 Difference]: With dead ends: 533 [2022-07-22 22:21:49,488 INFO L226 Difference]: Without dead ends: 444 [2022-07-22 22:21:49,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2022-07-22 22:21:49,489 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 166 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:49,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 911 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-22 22:21:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-07-22 22:21:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 427. [2022-07-22 22:21:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 265 states have (on average 1.0981132075471698) internal successors, (291), 274 states have internal predecessors, (291), 131 states have call successors, (131), 26 states have call predecessors, (131), 30 states have return successors, (213), 126 states have call predecessors, (213), 129 states have call successors, (213) [2022-07-22 22:21:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 635 transitions. [2022-07-22 22:21:49,550 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 635 transitions. Word has length 135 [2022-07-22 22:21:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:49,553 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 635 transitions. [2022-07-22 22:21:49,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 16 states have internal predecessors, (58), 8 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-22 22:21:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 635 transitions. [2022-07-22 22:21:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 22:21:49,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:49,557 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:21:49,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 22:21:49,557 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:49,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:49,557 INFO L85 PathProgramCache]: Analyzing trace with hash -743111176, now seen corresponding path program 1 times [2022-07-22 22:21:49,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:49,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722450839] [2022-07-22 22:21:49,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:49,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 22:21:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:21:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:21:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 22:21:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:21:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:21:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:21:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:21:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 22:21:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 22:21:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:21:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:21:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:21:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-22 22:21:49,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:49,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722450839] [2022-07-22 22:21:49,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722450839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:49,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:21:49,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:21:49,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852812289] [2022-07-22 22:21:49,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:49,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:21:49,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:49,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:21:49,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:21:49,848 INFO L87 Difference]: Start difference. First operand 427 states and 635 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-22 22:21:50,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:50,159 INFO L93 Difference]: Finished difference Result 593 states and 924 transitions. [2022-07-22 22:21:50,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:21:50,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2022-07-22 22:21:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:50,162 INFO L225 Difference]: With dead ends: 593 [2022-07-22 22:21:50,163 INFO L226 Difference]: Without dead ends: 418 [2022-07-22 22:21:50,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:21:50,165 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 44 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:50,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 329 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:21:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-22 22:21:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2022-07-22 22:21:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 257 states have (on average 1.093385214007782) internal successors, (281), 265 states have internal predecessors, (281), 131 states have call successors, (131), 26 states have call predecessors, (131), 29 states have return successors, (192), 126 states have call predecessors, (192), 129 states have call successors, (192) [2022-07-22 22:21:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 604 transitions. [2022-07-22 22:21:50,226 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 604 transitions. Word has length 135 [2022-07-22 22:21:50,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:50,226 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 604 transitions. [2022-07-22 22:21:50,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-22 22:21:50,227 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 604 transitions. [2022-07-22 22:21:50,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-22 22:21:50,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:50,229 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:21:50,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 22:21:50,230 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:50,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:50,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2134105364, now seen corresponding path program 1 times [2022-07-22 22:21:50,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:50,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844085106] [2022-07-22 22:21:50,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:50,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:21:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:21:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:21:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:21:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:21:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:21:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:21:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:21:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:21:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:21:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 22:21:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:21:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:21:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-22 22:21:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 22:21:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-22 22:21:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-22 22:21:50,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:50,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844085106] [2022-07-22 22:21:50,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844085106] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:50,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719686292] [2022-07-22 22:21:50,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:50,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:50,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:50,492 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) [2022-07-22 22:21:50,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 22:21:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:50,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 2739 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 22:21:50,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 94 proven. 84 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-22 22:21:51,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:21:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-22 22:21:51,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719686292] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:21:51,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:21:51,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-07-22 22:21:51,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221640339] [2022-07-22 22:21:51,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:21:51,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 22:21:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:51,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 22:21:51,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:21:51,233 INFO L87 Difference]: Start difference. First operand 418 states and 604 transitions. Second operand has 15 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 10 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (40), 7 states have call predecessors, (40), 10 states have call successors, (40) [2022-07-22 22:21:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:51,728 INFO L93 Difference]: Finished difference Result 560 states and 829 transitions. [2022-07-22 22:21:51,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:21:51,729 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 10 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (40), 7 states have call predecessors, (40), 10 states have call successors, (40) Word has length 139 [2022-07-22 22:21:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:51,731 INFO L225 Difference]: With dead ends: 560 [2022-07-22 22:21:51,732 INFO L226 Difference]: Without dead ends: 418 [2022-07-22 22:21:51,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-07-22 22:21:51,734 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 212 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:51,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 388 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:21:51,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-22 22:21:51,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2022-07-22 22:21:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 257 states have (on average 1.093385214007782) internal successors, (281), 265 states have internal predecessors, (281), 131 states have call successors, (131), 26 states have call predecessors, (131), 29 states have return successors, (184), 126 states have call predecessors, (184), 129 states have call successors, (184) [2022-07-22 22:21:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 596 transitions. [2022-07-22 22:21:51,781 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 596 transitions. Word has length 139 [2022-07-22 22:21:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:51,782 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 596 transitions. [2022-07-22 22:21:51,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 10 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (40), 7 states have call predecessors, (40), 10 states have call successors, (40) [2022-07-22 22:21:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 596 transitions. [2022-07-22 22:21:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-22 22:21:51,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:51,785 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2022-07-22 22:21:51,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-22 22:21:51,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-22 22:21:51,999 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:52,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1988577793, now seen corresponding path program 1 times [2022-07-22 22:21:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:52,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272076632] [2022-07-22 22:21:52,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:52,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 22:21:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:21:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:21:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 22:21:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:21:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:21:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:21:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:21:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 22:21:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 22:21:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:21:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:21:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:21:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-07-22 22:21:52,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:52,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272076632] [2022-07-22 22:21:52,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272076632] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:21:52,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:21:52,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 22:21:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240477498] [2022-07-22 22:21:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:21:52,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:21:52,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:21:52,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:21:52,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:21:52,343 INFO L87 Difference]: Start difference. First operand 418 states and 596 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-22 22:21:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:21:53,184 INFO L93 Difference]: Finished difference Result 426 states and 604 transitions. [2022-07-22 22:21:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 22:21:53,186 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2022-07-22 22:21:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:21:53,188 INFO L225 Difference]: With dead ends: 426 [2022-07-22 22:21:53,188 INFO L226 Difference]: Without dead ends: 424 [2022-07-22 22:21:53,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-22 22:21:53,190 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 74 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:21:53,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 997 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 22:21:53,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-07-22 22:21:53,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 423. [2022-07-22 22:21:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 260 states have (on average 1.0923076923076922) internal successors, (284), 268 states have internal predecessors, (284), 132 states have call successors, (132), 27 states have call predecessors, (132), 30 states have return successors, (185), 127 states have call predecessors, (185), 130 states have call successors, (185) [2022-07-22 22:21:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 601 transitions. [2022-07-22 22:21:53,237 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 601 transitions. Word has length 137 [2022-07-22 22:21:53,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:21:53,237 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 601 transitions. [2022-07-22 22:21:53,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-22 22:21:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 601 transitions. [2022-07-22 22:21:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-22 22:21:53,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:21:53,240 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1] [2022-07-22 22:21:53,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 22:21:53,241 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:21:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:21:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash -32643708, now seen corresponding path program 1 times [2022-07-22 22:21:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:21:53,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34610661] [2022-07-22 22:21:53,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:53,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:21:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:21:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:21:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 22:21:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:21:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:21:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 22:21:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:21:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:21:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:21:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:21:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 22:21:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 22:21:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:21:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:21:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:21:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-07-22 22:21:54,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:21:54,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34610661] [2022-07-22 22:21:54,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34610661] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:21:54,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616131680] [2022-07-22 22:21:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:21:54,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:21:54,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:21:54,294 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) [2022-07-22 22:21:54,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-22 22:21:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:21:54,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-22 22:21:54,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:21:54,711 INFO L390 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 [2022-07-22 22:21:54,853 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 22:21:54,854 INFO L390 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 [2022-07-22 22:21:54,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 22:21:55,244 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-07-22 22:21:55,244 INFO L390 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 20 treesize of output 22 [2022-07-22 22:21:55,286 INFO L390 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 23 treesize of output 23 [2022-07-22 22:21:59,377 INFO L390 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 23 treesize of output 23 [2022-07-22 22:22:27,819 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 22:22:27,819 INFO L390 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 15 treesize of output 21 [2022-07-22 22:22:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 28 proven. 106 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-22 22:22:28,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:22:29,005 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-22 22:22:29,005 INFO L390 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 19 treesize of output 18 [2022-07-22 22:22:29,066 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_999 (Array Int Int)) (|aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |aws_byte_cursor_left_trim_pred_~#trimmed~1.base| v_ArrVal_999) c_aws_byte_cursor_left_trim_pred_~source.base) (+ c_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)) (= c_aws_byte_cursor_left_trim_pred_~source.base |aws_byte_cursor_left_trim_pred_~#trimmed~1.base|))) (or (= c_aws_byte_cursor_left_trim_pred_~source.offset |c_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|) (forall ((v_ArrVal_999 (Array Int Int)) (|aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |aws_byte_cursor_left_trim_pred_~#trimmed~1.base| v_ArrVal_999) c_aws_byte_cursor_left_trim_pred_~source.base) (+ c_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0))))) is different from false [2022-07-22 22:22:29,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616131680] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:22:29,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:22:29,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28] total 39 [2022-07-22 22:22:29,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613301982] [2022-07-22 22:22:29,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 22:22:29,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-22 22:22:29,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:22:29,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-22 22:22:29,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2057, Unknown=3, NotChecked=92, Total=2352 [2022-07-22 22:22:29,091 INFO L87 Difference]: Start difference. First operand 423 states and 601 transitions. Second operand has 39 states, 39 states have (on average 3.1538461538461537) internal successors, (123), 33 states have internal predecessors, (123), 13 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2022-07-22 22:22:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:22:33,024 INFO L93 Difference]: Finished difference Result 629 states and 852 transitions. [2022-07-22 22:22:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-22 22:22:33,025 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.1538461538461537) internal successors, (123), 33 states have internal predecessors, (123), 13 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) Word has length 138 [2022-07-22 22:22:33,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:22:33,028 INFO L225 Difference]: With dead ends: 629 [2022-07-22 22:22:33,028 INFO L226 Difference]: Without dead ends: 512 [2022-07-22 22:22:33,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 149 SyntacticMatches, 22 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=444, Invalid=5256, Unknown=4, NotChecked=148, Total=5852 [2022-07-22 22:22:33,031 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 108 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 3127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1436 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:22:33,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1451 Invalid, 3127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1629 Invalid, 0 Unknown, 1436 Unchecked, 1.0s Time] [2022-07-22 22:22:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-07-22 22:22:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 493. [2022-07-22 22:22:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 320 states have (on average 1.090625) internal successors, (349), 327 states have internal predecessors, (349), 132 states have call successors, (132), 39 states have call predecessors, (132), 40 states have return successors, (185), 126 states have call predecessors, (185), 130 states have call successors, (185) [2022-07-22 22:22:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 666 transitions. [2022-07-22 22:22:33,086 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 666 transitions. Word has length 138 [2022-07-22 22:22:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:22:33,087 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 666 transitions. [2022-07-22 22:22:33,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.1538461538461537) internal successors, (123), 33 states have internal predecessors, (123), 13 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2022-07-22 22:22:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 666 transitions. [2022-07-22 22:22:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-22 22:22:33,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:22:33,090 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:22:33,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-22 22:22:33,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:22:33,315 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:22:33,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:22:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash 121582132, now seen corresponding path program 1 times [2022-07-22 22:22:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:22:33,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233506146] [2022-07-22 22:22:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:22:33,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:22:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:22:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:22:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:22:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:22:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:22:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:22:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:22:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:22:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:22:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:22:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:22:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:22:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 22:22:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:22:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:22:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 22:22:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:22:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 22:22:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-07-22 22:22:33,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:22:33,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233506146] [2022-07-22 22:22:33,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233506146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:22:33,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:22:33,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:22:33,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567903413] [2022-07-22 22:22:33,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:22:33,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:22:33,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:22:33,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:22:33,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:22:33,651 INFO L87 Difference]: Start difference. First operand 493 states and 666 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-22 22:22:34,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:22:34,182 INFO L93 Difference]: Finished difference Result 507 states and 683 transitions. [2022-07-22 22:22:34,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:22:34,183 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2022-07-22 22:22:34,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:22:34,186 INFO L225 Difference]: With dead ends: 507 [2022-07-22 22:22:34,186 INFO L226 Difference]: Without dead ends: 505 [2022-07-22 22:22:34,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:22:34,187 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 50 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:22:34,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 654 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:22:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-22 22:22:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 501. [2022-07-22 22:22:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 323 states have (on average 1.089783281733746) internal successors, (352), 330 states have internal predecessors, (352), 136 states have call successors, (136), 40 states have call predecessors, (136), 41 states have return successors, (189), 130 states have call predecessors, (189), 134 states have call successors, (189) [2022-07-22 22:22:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 677 transitions. [2022-07-22 22:22:34,238 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 677 transitions. Word has length 143 [2022-07-22 22:22:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:22:34,238 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 677 transitions. [2022-07-22 22:22:34,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-22 22:22:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 677 transitions. [2022-07-22 22:22:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-22 22:22:34,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:22:34,241 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:22:34,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-22 22:22:34,242 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:22:34,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:22:34,242 INFO L85 PathProgramCache]: Analyzing trace with hash 386312444, now seen corresponding path program 1 times [2022-07-22 22:22:34,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:22:34,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713002370] [2022-07-22 22:22:34,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:22:34,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:22:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:22:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:22:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:22:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:22:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:22:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:22:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:22:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:22:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:22:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:22:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:22:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:22:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 22:22:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:22:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:22:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 22:22:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:22:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 22:22:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-07-22 22:22:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:22:34,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713002370] [2022-07-22 22:22:34,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713002370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:22:34,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:22:34,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 22:22:34,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162912348] [2022-07-22 22:22:34,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:22:34,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 22:22:34,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:22:34,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 22:22:34,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:22:34,746 INFO L87 Difference]: Start difference. First operand 501 states and 677 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-22 22:22:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:22:35,985 INFO L93 Difference]: Finished difference Result 719 states and 1040 transitions. [2022-07-22 22:22:35,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:22:35,987 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 3 states have call successors, (19) Word has length 147 [2022-07-22 22:22:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:22:35,990 INFO L225 Difference]: With dead ends: 719 [2022-07-22 22:22:35,990 INFO L226 Difference]: Without dead ends: 563 [2022-07-22 22:22:35,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:22:35,992 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 69 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:22:35,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 627 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-22 22:22:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-07-22 22:22:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 535. [2022-07-22 22:22:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 342 states have (on average 1.0964912280701755) internal successors, (375), 349 states have internal predecessors, (375), 149 states have call successors, (149), 40 states have call predecessors, (149), 43 states have return successors, (196), 145 states have call predecessors, (196), 147 states have call successors, (196) [2022-07-22 22:22:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 720 transitions. [2022-07-22 22:22:36,050 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 720 transitions. Word has length 147 [2022-07-22 22:22:36,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:22:36,051 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 720 transitions. [2022-07-22 22:22:36,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-22 22:22:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 720 transitions. [2022-07-22 22:22:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-22 22:22:36,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:22:36,054 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:22:36,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-22 22:22:36,054 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:22:36,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:22:36,055 INFO L85 PathProgramCache]: Analyzing trace with hash 542080828, now seen corresponding path program 1 times [2022-07-22 22:22:36,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:22:36,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965708359] [2022-07-22 22:22:36,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:22:36,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:22:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:22:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:22:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:22:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:22:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:22:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:22:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:22:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:22:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:22:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:22:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:22:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:22:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 22:22:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:22:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:22:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 22:22:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:22:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-22 22:22:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2022-07-22 22:22:36,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:22:36,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965708359] [2022-07-22 22:22:36,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965708359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:22:36,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:22:36,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 22:22:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376850603] [2022-07-22 22:22:36,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:22:36,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:22:36,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:22:36,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:22:36,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:22:36,270 INFO L87 Difference]: Start difference. First operand 535 states and 720 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-22 22:22:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:22:36,555 INFO L93 Difference]: Finished difference Result 611 states and 830 transitions. [2022-07-22 22:22:36,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:22:36,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2022-07-22 22:22:36,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:22:36,559 INFO L225 Difference]: With dead ends: 611 [2022-07-22 22:22:36,559 INFO L226 Difference]: Without dead ends: 541 [2022-07-22 22:22:36,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:22:36,562 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 34 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:22:36,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 238 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:22:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-07-22 22:22:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2022-07-22 22:22:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 348 states have (on average 1.0948275862068966) internal successors, (381), 355 states have internal predecessors, (381), 149 states have call successors, (149), 40 states have call predecessors, (149), 43 states have return successors, (196), 145 states have call predecessors, (196), 147 states have call successors, (196) [2022-07-22 22:22:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 726 transitions. [2022-07-22 22:22:36,640 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 726 transitions. Word has length 150 [2022-07-22 22:22:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:22:36,640 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 726 transitions. [2022-07-22 22:22:36,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-22 22:22:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 726 transitions. [2022-07-22 22:22:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-22 22:22:36,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:22:36,643 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:22:36,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-22 22:22:36,644 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:22:36,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:22:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1517452615, now seen corresponding path program 1 times [2022-07-22 22:22:36,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:22:36,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393412722] [2022-07-22 22:22:36,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:22:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:22:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:22:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:22:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 22:22:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:22:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 22:22:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:22:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:22:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:22:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:22:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 22:22:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 22:22:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:22:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:22:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:36,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:22:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:37,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 22:22:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:37,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-22 22:22:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 38 proven. 21 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-07-22 22:22:37,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:22:37,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393412722] [2022-07-22 22:22:37,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393412722] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:22:37,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701729435] [2022-07-22 22:22:37,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:22:37,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:22:37,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:22:37,068 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) [2022-07-22 22:22:37,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-22 22:22:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:37,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 2792 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-22 22:22:37,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:22:37,499 INFO L390 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 [2022-07-22 22:22:37,622 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 22:22:37,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-22 22:22:37,916 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 22:22:37,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-22 22:22:37,950 INFO L390 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 17 treesize of output 19 [2022-07-22 22:22:40,033 INFO L390 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 17 treesize of output 19 [2022-07-22 22:22:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 80 proven. 77 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-22 22:22:56,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:22:57,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_1164) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* (div (+ (- 1) .cse0) 18446744073709551616) 18446744073709551616))))) is different from false [2022-07-22 22:22:57,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701729435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:22:57,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:22:57,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20] total 28 [2022-07-22 22:22:57,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69846863] [2022-07-22 22:22:57,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 22:22:57,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-22 22:22:57,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:22:57,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 22:22:57,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=884, Unknown=2, NotChecked=60, Total=1056 [2022-07-22 22:22:57,212 INFO L87 Difference]: Start difference. First operand 541 states and 726 transitions. Second operand has 28 states, 28 states have (on average 5.357142857142857) internal successors, (150), 25 states have internal predecessors, (150), 9 states have call successors, (37), 8 states have call predecessors, (37), 10 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-07-22 22:23:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:00,295 INFO L93 Difference]: Finished difference Result 819 states and 1106 transitions. [2022-07-22 22:23:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-22 22:23:00,296 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.357142857142857) internal successors, (150), 25 states have internal predecessors, (150), 9 states have call successors, (37), 8 states have call predecessors, (37), 10 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 149 [2022-07-22 22:23:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:00,299 INFO L225 Difference]: With dead ends: 819 [2022-07-22 22:23:00,299 INFO L226 Difference]: Without dead ends: 581 [2022-07-22 22:23:00,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 237 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=270, Invalid=2282, Unknown=2, NotChecked=98, Total=2652 [2022-07-22 22:23:00,302 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 130 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 563 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:00,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1018 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 747 Invalid, 0 Unknown, 563 Unchecked, 0.5s Time] [2022-07-22 22:23:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-07-22 22:23:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 532. [2022-07-22 22:23:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 352 states have (on average 1.09375) internal successors, (385), 359 states have internal predecessors, (385), 134 states have call successors, (134), 41 states have call predecessors, (134), 45 states have return successors, (177), 131 states have call predecessors, (177), 132 states have call successors, (177) [2022-07-22 22:23:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 696 transitions. [2022-07-22 22:23:00,363 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 696 transitions. Word has length 149 [2022-07-22 22:23:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:00,364 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 696 transitions. [2022-07-22 22:23:00,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.357142857142857) internal successors, (150), 25 states have internal predecessors, (150), 9 states have call successors, (37), 8 states have call predecessors, (37), 10 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-07-22 22:23:00,364 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 696 transitions. [2022-07-22 22:23:00,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-22 22:23:00,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:00,367 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:23:00,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-22 22:23:00,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-22 22:23:00,587 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:00,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:00,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1095383274, now seen corresponding path program 1 times [2022-07-22 22:23:00,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:00,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796820852] [2022-07-22 22:23:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:00,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:23:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:23:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:23:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:23:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:23:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:23:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:23:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:23:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:23:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:23:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:23:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 22:23:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:23:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:23:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 22:23:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:23:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 22:23:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 22:23:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-22 22:23:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-07-22 22:23:00,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:00,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796820852] [2022-07-22 22:23:00,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796820852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:00,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:00,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:23:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686195455] [2022-07-22 22:23:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:00,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:23:00,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:00,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:23:00,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:23:00,865 INFO L87 Difference]: Start difference. First operand 532 states and 696 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-22 22:23:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:01,251 INFO L93 Difference]: Finished difference Result 614 states and 807 transitions. [2022-07-22 22:23:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:23:01,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 155 [2022-07-22 22:23:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:01,254 INFO L225 Difference]: With dead ends: 614 [2022-07-22 22:23:01,254 INFO L226 Difference]: Without dead ends: 532 [2022-07-22 22:23:01,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:23:01,256 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:01,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 367 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:23:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-07-22 22:23:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2022-07-22 22:23:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 352 states have (on average 1.09375) internal successors, (385), 359 states have internal predecessors, (385), 134 states have call successors, (134), 41 states have call predecessors, (134), 45 states have return successors, (173), 131 states have call predecessors, (173), 132 states have call successors, (173) [2022-07-22 22:23:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 692 transitions. [2022-07-22 22:23:01,318 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 692 transitions. Word has length 155 [2022-07-22 22:23:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:01,318 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 692 transitions. [2022-07-22 22:23:01,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-22 22:23:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 692 transitions. [2022-07-22 22:23:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-22 22:23:01,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:01,326 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:23:01,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-22 22:23:01,326 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:01,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash -38056338, now seen corresponding path program 1 times [2022-07-22 22:23:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:01,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203762368] [2022-07-22 22:23:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:01,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:23:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:23:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:23:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:23:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:23:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:23:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:23:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:23:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:23:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:23:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:23:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 22:23:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:23:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:23:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 22:23:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:23:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-22 22:23:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-22 22:23:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-07-22 22:23:01,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:01,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203762368] [2022-07-22 22:23:01,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203762368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:01,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:01,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:23:01,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842217350] [2022-07-22 22:23:01,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:01,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:23:01,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:01,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:23:01,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:23:01,706 INFO L87 Difference]: Start difference. First operand 532 states and 692 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-22 22:23:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:02,506 INFO L93 Difference]: Finished difference Result 674 states and 918 transitions. [2022-07-22 22:23:02,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:23:02,506 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) Word has length 156 [2022-07-22 22:23:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:02,509 INFO L225 Difference]: With dead ends: 674 [2022-07-22 22:23:02,509 INFO L226 Difference]: Without dead ends: 548 [2022-07-22 22:23:02,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:23:02,511 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 53 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:02,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 486 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 22:23:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-22 22:23:02,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 520. [2022-07-22 22:23:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 344 states have (on average 1.072674418604651) internal successors, (369), 351 states have internal predecessors, (369), 130 states have call successors, (130), 41 states have call predecessors, (130), 45 states have return successors, (169), 127 states have call predecessors, (169), 128 states have call successors, (169) [2022-07-22 22:23:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 668 transitions. [2022-07-22 22:23:02,567 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 668 transitions. Word has length 156 [2022-07-22 22:23:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:02,567 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 668 transitions. [2022-07-22 22:23:02,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-22 22:23:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 668 transitions. [2022-07-22 22:23:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-22 22:23:02,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:02,570 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:23:02,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-22 22:23:02,571 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:02,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash -23336005, now seen corresponding path program 1 times [2022-07-22 22:23:02,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:02,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147403966] [2022-07-22 22:23:02,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:02,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:23:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:23:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:23:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:23:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:23:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:23:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:23:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:23:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:23:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:23:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:23:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 22:23:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:23:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:23:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 22:23:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:23:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 22:23:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 22:23:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-22 22:23:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2022-07-22 22:23:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:02,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147403966] [2022-07-22 22:23:02,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147403966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:02,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:02,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:23:02,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335023426] [2022-07-22 22:23:02,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:02,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:23:02,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:02,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:23:02,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:23:02,847 INFO L87 Difference]: Start difference. First operand 520 states and 668 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-22 22:23:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:03,357 INFO L93 Difference]: Finished difference Result 534 states and 685 transitions. [2022-07-22 22:23:03,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:23:03,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 157 [2022-07-22 22:23:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:03,361 INFO L225 Difference]: With dead ends: 534 [2022-07-22 22:23:03,361 INFO L226 Difference]: Without dead ends: 532 [2022-07-22 22:23:03,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:23:03,362 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 50 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:03,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 653 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:23:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-07-22 22:23:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 528. [2022-07-22 22:23:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 347 states have (on average 1.0720461095100864) internal successors, (372), 354 states have internal predecessors, (372), 134 states have call successors, (134), 42 states have call predecessors, (134), 46 states have return successors, (173), 131 states have call predecessors, (173), 132 states have call successors, (173) [2022-07-22 22:23:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 679 transitions. [2022-07-22 22:23:03,420 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 679 transitions. Word has length 157 [2022-07-22 22:23:03,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:03,420 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 679 transitions. [2022-07-22 22:23:03,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-22 22:23:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 679 transitions. [2022-07-22 22:23:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-22 22:23:03,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:03,423 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:23:03,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-22 22:23:03,424 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:03,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:03,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1886376426, now seen corresponding path program 1 times [2022-07-22 22:23:03,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:03,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454663226] [2022-07-22 22:23:03,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:03,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:23:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:23:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 22:23:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:23:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 22:23:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:23:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:23:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:23:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:23:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 22:23:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 22:23:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:23:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:23:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:23:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-22 22:23:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 22:23:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 56 proven. 19 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-07-22 22:23:04,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:04,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454663226] [2022-07-22 22:23:04,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454663226] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:23:04,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903088829] [2022-07-22 22:23:04,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:04,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:23:04,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:23:04,532 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) [2022-07-22 22:23:04,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-22 22:23:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:05,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-22 22:23:05,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:23:07,391 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_32| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_27| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_32|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_27|)) 0))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_32| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_27| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_32|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_27|)) 0)))) is different from true [2022-07-22 22:23:09,451 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_33| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_33|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_28|)) 0))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_33| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_33|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_28|)) 0)))) is different from true [2022-07-22 22:23:11,543 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29)) 0)))) is different from true [2022-07-22 22:23:13,612 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29)) 0)))) (let ((.cse0 (+ c_aws_byte_cursor_left_trim_pred_~source.offset 8))) (or (not (= (select (select |c_#memory_$Pointer$.offset| c_aws_byte_cursor_left_trim_pred_~source.base) .cse0) 0)) (not (= (select (select |c_#memory_$Pointer$.base| c_aws_byte_cursor_left_trim_pred_~source.base) .cse0) 0))))) is different from true [2022-07-22 22:23:15,624 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30)) 0)))) (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29)) 0))))) is different from true [2022-07-22 22:23:17,665 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30)) 0)))) (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29)) 0)))) (let ((.cse0 (+ c_aws_byte_cursor_left_trim_pred_~source.offset 8))) (or (not (= (select (select |c_#memory_$Pointer$.offset| c_aws_byte_cursor_left_trim_pred_~source.base) .cse0) 0)) (not (= (select (select |c_#memory_$Pointer$.base| c_aws_byte_cursor_left_trim_pred_~source.base) .cse0) 0))))) is different from true [2022-07-22 22:23:19,708 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30)) 0)))) (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29)) 0)))) (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_36 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_31 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_36) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_31)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_36 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_31 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_36) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_31)) 0))))) is different from true [2022-07-22 22:23:21,625 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_1| Int) (aws_byte_cursor_left_trim_pred_~source.base Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_32 Int)) (let ((.cse0 (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| aws_byte_cursor_left_trim_pred_~source.base) .cse0))) (and (= (select (select |c_#memory_$Pointer$.offset| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_1|) 8) (select (select |c_#memory_$Pointer$.offset| aws_byte_cursor_left_trim_pred_~source.base) .cse0)) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_1|) 8)) (not (= .cse1 0)))))) (exists ((|v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_1| Int) (aws_byte_cursor_left_trim_pred_~source.base Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_32 Int)) (let ((.cse3 (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_32))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| aws_byte_cursor_left_trim_pred_~source.base) .cse3))) (and (= (select (select |c_#memory_$Pointer$.offset| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_1|) 8) .cse2) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$.base| aws_byte_cursor_left_trim_pred_~source.base) .cse3) (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_1|) 8))))))) is different from true [2022-07-22 22:23:25,439 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_2| Int) (aws_byte_cursor_left_trim_pred_~source.base Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_33 Int)) (let ((.cse1 (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_33))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| aws_byte_cursor_left_trim_pred_~source.base) .cse1))) (and (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.base| aws_byte_cursor_left_trim_pred_~source.base) .cse1) (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_2|) 8)) (= (select (select |c_#memory_$Pointer$.offset| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_2|) 8) .cse0))))) (exists ((|v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_2| Int) (aws_byte_cursor_left_trim_pred_~source.base Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_33 Int)) (let ((.cse3 (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_33))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| aws_byte_cursor_left_trim_pred_~source.base) .cse3))) (and (not (= .cse2 0)) (= .cse2 (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_2|) 8)) (= (select (select |c_#memory_$Pointer$.offset| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_2|) 8) (select (select |c_#memory_$Pointer$.offset| aws_byte_cursor_left_trim_pred_~source.base) .cse3))))))) is different from true [2022-07-22 22:23:31,615 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((aws_byte_cursor_left_trim_pred_~source.base Int) (|v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_3| Int) (aws_byte_cursor_left_trim_pred_~source.offset Int)) (let ((.cse1 (+ aws_byte_cursor_left_trim_pred_~source.offset 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| aws_byte_cursor_left_trim_pred_~source.base) .cse1))) (and (not (= .cse0 0)) (= .cse0 (select (select |c_#memory_$Pointer$.offset| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_3|) 8)) (= (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_3|) 8) (select (select |c_#memory_$Pointer$.base| aws_byte_cursor_left_trim_pred_~source.base) .cse1)))))) (exists ((aws_byte_cursor_left_trim_pred_~source.base Int) (|v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_3| Int) (aws_byte_cursor_left_trim_pred_~source.offset Int)) (let ((.cse3 (+ aws_byte_cursor_left_trim_pred_~source.offset 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| aws_byte_cursor_left_trim_pred_~source.base) .cse3))) (and (not (= 0 .cse2)) (= (select (select |c_#memory_$Pointer$.offset| aws_byte_cursor_left_trim_pred_~source.base) .cse3) (select (select |c_#memory_$Pointer$.offset| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_3|) 8)) (= (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_3|) 8) .cse2)))))) is different from true [2022-07-22 22:23:37,411 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((aws_byte_cursor_left_trim_pred_~source.base Int) (|v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_4| Int) (aws_byte_cursor_left_trim_pred_~source.offset Int)) (let ((.cse0 (+ aws_byte_cursor_left_trim_pred_~source.offset 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| aws_byte_cursor_left_trim_pred_~source.base) .cse0))) (and (= (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_4|) 8) (select (select |c_#memory_$Pointer$.base| aws_byte_cursor_left_trim_pred_~source.base) .cse0)) (not (= .cse1 0)) (= .cse1 (select (select |c_#memory_$Pointer$.offset| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_4|) 8)))))) (exists ((aws_byte_cursor_left_trim_pred_~source.base Int) (|v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_4| Int) (aws_byte_cursor_left_trim_pred_~source.offset Int)) (let ((.cse3 (+ aws_byte_cursor_left_trim_pred_~source.offset 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| aws_byte_cursor_left_trim_pred_~source.base) .cse3))) (and (= (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_4|) 8) .cse2) (not (= 0 .cse2)) (= (select (select |c_#memory_$Pointer$.offset| aws_byte_cursor_left_trim_pred_~source.base) .cse3) (select (select |c_#memory_$Pointer$.offset| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_4|) 8))))))) is different from true [2022-07-22 22:23:47,218 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:23:59,432 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:24:11,586 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:24:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 121 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 83 not checked. [2022-07-22 22:24:11,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:24:12,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903088829] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:24:12,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:24:12,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27] total 40 [2022-07-22 22:24:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695443030] [2022-07-22 22:24:12,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 22:24:12,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-22 22:24:12,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:24:12,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-22 22:24:12,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=898, Unknown=15, NotChecked=770, Total=1806 [2022-07-22 22:24:12,095 INFO L87 Difference]: Start difference. First operand 528 states and 679 transitions. Second operand has 40 states, 38 states have (on average 3.9210526315789473) internal successors, (149), 35 states have internal predecessors, (149), 14 states have call successors, (36), 14 states have call predecessors, (36), 12 states have return successors, (33), 13 states have call predecessors, (33), 13 states have call successors, (33) [2022-07-22 22:24:39,738 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)