./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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_from_array_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 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:04:51,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:04:51,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:04:52,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:04:52,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:04:52,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:04:52,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:04:52,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:04:52,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:04:52,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:04:52,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:04:52,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:04:52,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:04:52,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:04:52,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:04:52,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:04:52,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:04:52,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:04:52,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:04:52,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:04:52,076 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:04:52,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:04:52,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:04:52,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:04:52,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:04:52,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:04:52,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:04:52,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:04:52,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:04:52,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:04:52,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:04:52,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:04:52,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:04:52,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:04:52,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:04:52,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:04:52,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:04:52,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:04:52,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:04:52,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:04:52,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:04:52,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:04:52,098 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:04:52,137 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:04:52,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:04:52,138 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:04:52,138 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:04:52,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:04:52,139 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:04:52,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:04:52,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:04:52,140 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:04:52,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:04:52,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:04:52,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:04:52,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:04:52,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:04:52,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:04:52,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:04:52,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:04:52,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:04:52,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:04:52,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:04:52,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:04:52,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:04:52,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:04:52,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:04:52,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:04:52,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:04:52,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:04:52,144 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:04:52,144 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:04:52,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:04:52,145 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 -> 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c [2022-07-19 22:04:52,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:04:52,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:04:52,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:04:52,395 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:04:52,396 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:04:52,397 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_from_array_harness.i [2022-07-19 22:04:52,458 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cc1026a9/1462b1bafd584f7899046915d5e8253b/FLAGe1867a941 [2022-07-19 22:04:53,144 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:04:53,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2022-07-19 22:04:53,181 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cc1026a9/1462b1bafd584f7899046915d5e8253b/FLAGe1867a941 [2022-07-19 22:04:53,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cc1026a9/1462b1bafd584f7899046915d5e8253b [2022-07-19 22:04:53,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:04:53,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:04:53,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:04:53,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:04:53,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:04:53,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:04:53" (1/1) ... [2022-07-19 22:04:53,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53abcb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:04:53, skipping insertion in model container [2022-07-19 22:04:53,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:04:53" (1/1) ... [2022-07-19 22:04:53,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:04:53,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:04:53,823 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_from_array_harness.i[4500,4513] [2022-07-19 22:04:53,830 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_from_array_harness.i[4560,4573] [2022-07-19 22:04:54,578 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:54,579 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:54,580 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:54,581 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:54,581 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:54,593 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:54,594 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:54,595 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:54,596 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:54,822 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:04:54,823 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:04:54,824 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:04:54,825 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:04:54,827 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:04:54,828 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:04:54,829 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:04:54,829 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:04:54,830 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:04:54,830 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:04:54,995 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:04:55,093 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:55,094 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:55,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:04:55,225 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:04:55,248 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_from_array_harness.i[4500,4513] [2022-07-19 22:04:55,250 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_from_array_harness.i[4560,4573] [2022-07-19 22:04:55,282 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:55,283 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:55,284 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:55,284 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:55,284 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:55,293 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:55,294 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:55,297 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:55,297 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:55,327 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:04:55,328 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:04:55,329 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:04:55,329 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:04:55,330 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:04:55,330 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:04:55,331 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:04:55,333 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:04:55,334 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:04:55,334 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:04:55,387 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:04:55,428 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:55,429 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:04:55,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:04:55,609 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:04:55,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:04:55 WrapperNode [2022-07-19 22:04:55,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:04:55,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:04:55,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:04:55,611 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:04:55,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:04:55" (1/1) ... [2022-07-19 22:04:55,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:04:55" (1/1) ... [2022-07-19 22:04:55,784 INFO L137 Inliner]: procedures = 690, calls = 2609, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 777 [2022-07-19 22:04:55,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:04:55,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:04:55,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:04:55,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:04:55,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:04:55" (1/1) ... [2022-07-19 22:04:55,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:04:55" (1/1) ... [2022-07-19 22:04:55,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:04:55" (1/1) ... [2022-07-19 22:04:55,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:04:55" (1/1) ... [2022-07-19 22:04:55,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:04:55" (1/1) ... [2022-07-19 22:04:55,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:04:55" (1/1) ... [2022-07-19 22:04:55,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:04:55" (1/1) ... [2022-07-19 22:04:55,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:04:55,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:04:55,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:04:55,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:04:55,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:04:55" (1/1) ... [2022-07-19 22:04:55,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:04:55,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:55,893 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-19 22:04:55,919 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-19 22:04:55,934 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-19 22:04:55,935 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-19 22:04:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:04:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:04:55,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 22:04:55,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 22:04:55,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:04:55,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:04:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:04:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:04:55,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:04:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 22:04:55,938 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 22:04:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 22:04:55,939 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 22:04:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:04:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:04:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:04:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 22:04:55,939 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 22:04:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:04:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:04:56,223 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:04:56,225 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:04:57,016 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:04:57,022 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:04:57,023 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 22:04:57,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:04:57 BoogieIcfgContainer [2022-07-19 22:04:57,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:04:57,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:04:57,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:04:57,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:04:57,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:04:53" (1/3) ... [2022-07-19 22:04:57,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb2efba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:04:57, skipping insertion in model container [2022-07-19 22:04:57,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:04:55" (2/3) ... [2022-07-19 22:04:57,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb2efba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:04:57, skipping insertion in model container [2022-07-19 22:04:57,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:04:57" (3/3) ... [2022-07-19 22:04:57,034 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2022-07-19 22:04:57,047 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:04:57,047 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:04:57,109 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:04:57,119 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@1b1fb4ac, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4e605781 [2022-07-19 22:04:57,120 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:04:57,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-19 22:04:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 22:04:57,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:57,135 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 22:04:57,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:57,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:57,142 INFO L85 PathProgramCache]: Analyzing trace with hash -860547149, now seen corresponding path program 1 times [2022-07-19 22:04:57,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:57,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022851681] [2022-07-19 22:04:57,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:57,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:57,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:57,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:57,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:04:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:57,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:04:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 22:04:57,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:57,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022851681] [2022-07-19 22:04:57,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022851681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:57,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:57,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 22:04:57,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569215462] [2022-07-19 22:04:57,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:57,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 22:04:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:57,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 22:04:57,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:04:57,833 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 22:04:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:57,968 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2022-07-19 22:04:57,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:04:57,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-07-19 22:04:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:57,977 INFO L225 Difference]: With dead ends: 117 [2022-07-19 22:04:57,977 INFO L226 Difference]: Without dead ends: 54 [2022-07-19 22:04:57,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-19 22:04:57,983 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:57,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:04:57,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-19 22:04:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-07-19 22:04:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 22:04:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-07-19 22:04:58,020 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 29 [2022-07-19 22:04:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:58,020 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-07-19 22:04:58,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 22:04:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-07-19 22:04:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 22:04:58,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:58,023 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 22:04:58,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 22:04:58,023 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:58,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:58,024 INFO L85 PathProgramCache]: Analyzing trace with hash 617864563, now seen corresponding path program 1 times [2022-07-19 22:04:58,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:58,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223612847] [2022-07-19 22:04:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:58,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:04:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:04:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 22:04:58,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:58,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223612847] [2022-07-19 22:04:58,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223612847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:58,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:58,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:04:58,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866951053] [2022-07-19 22:04:58,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:58,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:04:58,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:58,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:04:58,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:04:58,311 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 22:04:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:58,490 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2022-07-19 22:04:58,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:04:58,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-07-19 22:04:58,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:58,493 INFO L225 Difference]: With dead ends: 99 [2022-07-19 22:04:58,493 INFO L226 Difference]: Without dead ends: 57 [2022-07-19 22:04:58,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-19 22:04:58,495 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:58,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 116 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:04:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-19 22:04:58,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-19 22:04:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-19 22:04:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2022-07-19 22:04:58,518 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 29 [2022-07-19 22:04:58,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:58,519 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2022-07-19 22:04:58,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 22:04:58,519 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-07-19 22:04:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 22:04:58,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:58,521 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 22:04:58,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 22:04:58,522 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:58,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:58,523 INFO L85 PathProgramCache]: Analyzing trace with hash 633470424, now seen corresponding path program 1 times [2022-07-19 22:04:58,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:58,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442372597] [2022-07-19 22:04:58,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:58,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:04:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:04:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 22:04:58,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:58,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442372597] [2022-07-19 22:04:58,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442372597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:58,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:58,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:04:58,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110121321] [2022-07-19 22:04:58,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:58,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:04:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:58,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:04:58,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:04:58,863 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 22:04:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:59,161 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-07-19 22:04:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:04:59,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-07-19 22:04:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:59,163 INFO L225 Difference]: With dead ends: 69 [2022-07-19 22:04:59,163 INFO L226 Difference]: Without dead ends: 67 [2022-07-19 22:04:59,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 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-19 22:04:59,164 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 47 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:59,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 222 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:04:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-19 22:04:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-07-19 22:04:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-19 22:04:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-07-19 22:04:59,174 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 31 [2022-07-19 22:04:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:59,174 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-07-19 22:04:59,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 22:04:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-07-19 22:04:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 22:04:59,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:59,176 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 22:04:59,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 22:04:59,180 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash -843890528, now seen corresponding path program 1 times [2022-07-19 22:04:59,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:59,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811561839] [2022-07-19 22:04:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:59,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:04:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:04:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 22:04:59,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:59,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811561839] [2022-07-19 22:04:59,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811561839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:59,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:59,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:04:59,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663290726] [2022-07-19 22:04:59,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:59,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:04:59,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:59,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:04:59,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:04:59,657 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 22:05:00,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:00,058 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2022-07-19 22:05:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:05:00,059 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-07-19 22:05:00,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:00,060 INFO L225 Difference]: With dead ends: 127 [2022-07-19 22:05:00,060 INFO L226 Difference]: Without dead ends: 78 [2022-07-19 22:05:00,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:05:00,062 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 86 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:00,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 205 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:05:00,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-19 22:05:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2022-07-19 22:05:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-19 22:05:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-07-19 22:05:00,070 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 35 [2022-07-19 22:05:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:00,071 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-07-19 22:05:00,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 22:05:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-07-19 22:05:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 22:05:00,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:00,072 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 22:05:00,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:05:00,073 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:00,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:00,073 INFO L85 PathProgramCache]: Analyzing trace with hash -585725090, now seen corresponding path program 1 times [2022-07-19 22:05:00,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:00,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385401555] [2022-07-19 22:05:00,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:00,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 22:05:00,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:00,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385401555] [2022-07-19 22:05:00,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385401555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:00,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:00,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:05:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991564272] [2022-07-19 22:05:00,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:00,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:05:00,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:00,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:05:00,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:05:00,402 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 22:05:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:00,582 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2022-07-19 22:05:00,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:05:00,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-07-19 22:05:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:00,583 INFO L225 Difference]: With dead ends: 121 [2022-07-19 22:05:00,583 INFO L226 Difference]: Without dead ends: 68 [2022-07-19 22:05:00,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-19 22:05:00,584 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 36 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:00,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 114 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:05:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-19 22:05:00,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-19 22:05:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.108695652173913) internal successors, (51), 49 states have internal predecessors, (51), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-19 22:05:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-07-19 22:05:00,599 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 35 [2022-07-19 22:05:00,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:00,601 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-07-19 22:05:00,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 22:05:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-07-19 22:05:00,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 22:05:00,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:00,605 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 22:05:00,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 22:05:00,606 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:00,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1626961765, now seen corresponding path program 1 times [2022-07-19 22:05:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:00,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236854861] [2022-07-19 22:05:00,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:00,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 22:05:00,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:00,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236854861] [2022-07-19 22:05:00,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236854861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:00,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:00,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:05:00,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242716177] [2022-07-19 22:05:00,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:00,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:05:00,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:00,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:05:00,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:05:00,946 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 22:05:01,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:01,310 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2022-07-19 22:05:01,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:05:01,314 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-07-19 22:05:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:01,316 INFO L225 Difference]: With dead ends: 82 [2022-07-19 22:05:01,316 INFO L226 Difference]: Without dead ends: 80 [2022-07-19 22:05:01,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:05:01,317 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:01,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 272 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:05:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-19 22:05:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-07-19 22:05:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 51 states have internal predecessors, (53), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-19 22:05:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2022-07-19 22:05:01,324 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 37 [2022-07-19 22:05:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:01,324 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2022-07-19 22:05:01,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 22:05:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2022-07-19 22:05:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 22:05:01,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:01,325 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 22:05:01,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 22:05:01,325 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:01,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:01,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1966940953, now seen corresponding path program 1 times [2022-07-19 22:05:01,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:01,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165476471] [2022-07-19 22:05:01,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:01,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 22:05:01,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:01,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165476471] [2022-07-19 22:05:01,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165476471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:01,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:01,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 22:05:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105112886] [2022-07-19 22:05:01,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:01,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 22:05:01,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:01,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 22:05:01,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:05:01,659 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 22:05:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:02,192 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-07-19 22:05:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 22:05:02,192 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-07-19 22:05:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:02,194 INFO L225 Difference]: With dead ends: 81 [2022-07-19 22:05:02,194 INFO L226 Difference]: Without dead ends: 79 [2022-07-19 22:05:02,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-19 22:05:02,195 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:02,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 311 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:05:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-19 22:05:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2022-07-19 22:05:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-19 22:05:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-07-19 22:05:02,205 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 37 [2022-07-19 22:05:02,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:02,205 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-07-19 22:05:02,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 22:05:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-07-19 22:05:02,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 22:05:02,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:02,210 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:02,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 22:05:02,211 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:02,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:02,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1038585084, now seen corresponding path program 1 times [2022-07-19 22:05:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:02,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111228868] [2022-07-19 22:05:02,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:02,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 22:05:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:05:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 22:05:02,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:02,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111228868] [2022-07-19 22:05:02,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111228868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:02,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:02,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:05:02,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697586826] [2022-07-19 22:05:02,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:02,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:05:02,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:02,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:05:02,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:05:02,404 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:05:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:02,549 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-07-19 22:05:02,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:05:02,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-07-19 22:05:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:02,551 INFO L225 Difference]: With dead ends: 91 [2022-07-19 22:05:02,551 INFO L226 Difference]: Without dead ends: 63 [2022-07-19 22:05:02,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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-19 22:05:02,552 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 49 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:02,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 98 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:05:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-19 22:05:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-19 22:05:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 45 states have internal predecessors, (47), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-19 22:05:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2022-07-19 22:05:02,557 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2022-07-19 22:05:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:02,557 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2022-07-19 22:05:02,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:05:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-07-19 22:05:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 22:05:02,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:02,558 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:02,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:05:02,559 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:02,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:02,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1442491607, now seen corresponding path program 1 times [2022-07-19 22:05:02,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:02,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210467740] [2022-07-19 22:05:02,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:02,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 22:05:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:05:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:02,832 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:05:02,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:02,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210467740] [2022-07-19 22:05:02,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210467740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:02,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:02,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:05:02,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647692105] [2022-07-19 22:05:02,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:02,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:05:02,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:02,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:05:02,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:05:02,836 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 22:05:03,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:03,071 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-07-19 22:05:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:05:03,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2022-07-19 22:05:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:03,072 INFO L225 Difference]: With dead ends: 75 [2022-07-19 22:05:03,073 INFO L226 Difference]: Without dead ends: 73 [2022-07-19 22:05:03,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 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-19 22:05:03,073 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 42 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:03,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 220 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:05:03,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-19 22:05:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2022-07-19 22:05:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-19 22:05:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-07-19 22:05:03,079 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 46 [2022-07-19 22:05:03,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:03,079 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-07-19 22:05:03,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 22:05:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-07-19 22:05:03,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 22:05:03,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:03,080 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:03,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 22:05:03,081 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:03,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash 979191153, now seen corresponding path program 1 times [2022-07-19 22:05:03,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:03,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307552192] [2022-07-19 22:05:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:03,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:03,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:03,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:03,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:03,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:03,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 22:05:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:03,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:05:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 22:05:03,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:03,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307552192] [2022-07-19 22:05:03,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307552192] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:03,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915464132] [2022-07-19 22:05:03,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:03,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:03,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:03,495 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-19 22:05:03,500 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-19 22:05:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:03,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 2424 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-19 22:05:03,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:04,015 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 11 treesize of output 7 [2022-07-19 22:05:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 22:05:04,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:05:04,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915464132] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:04,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:05:04,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2022-07-19 22:05:04,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892098505] [2022-07-19 22:05:04,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:05:04,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 22:05:04,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:04,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 22:05:04,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2022-07-19 22:05:04,912 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 22:05:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:05,572 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2022-07-19 22:05:05,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-19 22:05:05,573 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 50 [2022-07-19 22:05:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:05,574 INFO L225 Difference]: With dead ends: 141 [2022-07-19 22:05:05,574 INFO L226 Difference]: Without dead ends: 111 [2022-07-19 22:05:05,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2022-07-19 22:05:05,576 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 92 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:05,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 407 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 460 Invalid, 0 Unknown, 341 Unchecked, 0.4s Time] [2022-07-19 22:05:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-19 22:05:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2022-07-19 22:05:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2022-07-19 22:05:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2022-07-19 22:05:05,586 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 50 [2022-07-19 22:05:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:05,586 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2022-07-19 22:05:05,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 22:05:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2022-07-19 22:05:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 22:05:05,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:05,587 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:05,618 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-19 22:05:05,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 22:05:05,810 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:05,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:05,810 INFO L85 PathProgramCache]: Analyzing trace with hash -472877729, now seen corresponding path program 1 times [2022-07-19 22:05:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:05,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611848113] [2022-07-19 22:05:05,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:05,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 22:05:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:05:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:05:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 22:05:06,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:06,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611848113] [2022-07-19 22:05:06,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611848113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:06,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:06,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:05:06,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278154362] [2022-07-19 22:05:06,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:06,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:05:06,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:06,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:05:06,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:05:06,165 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 22:05:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:06,507 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-07-19 22:05:06,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:05:06,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 52 [2022-07-19 22:05:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:06,509 INFO L225 Difference]: With dead ends: 103 [2022-07-19 22:05:06,509 INFO L226 Difference]: Without dead ends: 101 [2022-07-19 22:05:06,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:05:06,510 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 49 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:06,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 132 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:05:06,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-19 22:05:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-19 22:05:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 15 states have call successors, (15), 10 states have call predecessors, (15), 13 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2022-07-19 22:05:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-07-19 22:05:06,520 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 52 [2022-07-19 22:05:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:06,520 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-07-19 22:05:06,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 22:05:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-07-19 22:05:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 22:05:06,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:06,522 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:06,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 22:05:06,522 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:06,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:06,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1896049654, now seen corresponding path program 1 times [2022-07-19 22:05:06,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:06,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728810269] [2022-07-19 22:05:06,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:06,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 22:05:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:05:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:05:06,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:06,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728810269] [2022-07-19 22:05:06,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728810269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:06,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:06,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:05:06,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750831832] [2022-07-19 22:05:06,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:06,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:05:06,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:06,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:05:06,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:05:06,764 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 22:05:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:07,076 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2022-07-19 22:05:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:05:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2022-07-19 22:05:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:07,077 INFO L225 Difference]: With dead ends: 121 [2022-07-19 22:05:07,077 INFO L226 Difference]: Without dead ends: 119 [2022-07-19 22:05:07,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:05:07,078 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 46 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:07,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 271 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:05:07,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-19 22:05:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2022-07-19 22:05:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.0759493670886076) internal successors, (85), 84 states have internal predecessors, (85), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-19 22:05:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2022-07-19 22:05:07,097 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 52 [2022-07-19 22:05:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:07,097 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2022-07-19 22:05:07,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 22:05:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2022-07-19 22:05:07,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 22:05:07,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:07,098 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:07,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 22:05:07,098 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:07,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:07,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1697853064, now seen corresponding path program 1 times [2022-07-19 22:05:07,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:07,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322065750] [2022-07-19 22:05:07,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:07,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:07,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:07,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 22:05:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:07,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:05:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:05:07,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:07,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322065750] [2022-07-19 22:05:07,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322065750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:07,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:07,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 22:05:07,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600343706] [2022-07-19 22:05:07,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:07,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 22:05:07,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:07,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 22:05:07,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:05:07,381 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 22:05:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:07,877 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2022-07-19 22:05:07,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 22:05:07,878 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2022-07-19 22:05:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:07,879 INFO L225 Difference]: With dead ends: 121 [2022-07-19 22:05:07,879 INFO L226 Difference]: Without dead ends: 119 [2022-07-19 22:05:07,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-19 22:05:07,880 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:07,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 311 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:05:07,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-19 22:05:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 97. [2022-07-19 22:05:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 72 states have internal predecessors, (75), 15 states have call successors, (15), 10 states have call predecessors, (15), 12 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-07-19 22:05:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-07-19 22:05:07,889 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 52 [2022-07-19 22:05:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:07,889 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-07-19 22:05:07,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 22:05:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-07-19 22:05:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-19 22:05:07,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:07,890 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:07,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 22:05:07,891 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:07,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:07,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1077690052, now seen corresponding path program 1 times [2022-07-19 22:05:07,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:07,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749099118] [2022-07-19 22:05:07,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:08,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:08,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:08,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:08,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:05:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:08,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:05:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 22:05:08,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:08,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749099118] [2022-07-19 22:05:08,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749099118] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:08,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871344542] [2022-07-19 22:05:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:08,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:08,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:08,134 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-19 22:05:08,162 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-19 22:05:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:08,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 2441 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 22:05:08,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 22:05:08,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:05:08,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871344542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:08,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:05:08,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-07-19 22:05:08,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451394824] [2022-07-19 22:05:08,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:08,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:05:08,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:08,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:05:08,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:05:08,685 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:05:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:08,838 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2022-07-19 22:05:08,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:05:08,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2022-07-19 22:05:08,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:08,840 INFO L225 Difference]: With dead ends: 169 [2022-07-19 22:05:08,840 INFO L226 Difference]: Without dead ends: 99 [2022-07-19 22:05:08,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:05:08,842 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:08,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 197 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2022-07-19 22:05:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-19 22:05:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-07-19 22:05:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 72 states have internal predecessors, (73), 15 states have call successors, (15), 10 states have call predecessors, (15), 12 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-07-19 22:05:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-07-19 22:05:08,857 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 56 [2022-07-19 22:05:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:08,857 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-07-19 22:05:08,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:05:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-07-19 22:05:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-19 22:05:08,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:08,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:08,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 22:05:09,079 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,SelfDestructingSolverStorable13 [2022-07-19 22:05:09,080 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:09,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1100322306, now seen corresponding path program 1 times [2022-07-19 22:05:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:09,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440883924] [2022-07-19 22:05:09,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:09,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:09,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:09,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:09,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:09,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:05:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:09,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:05:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 22:05:09,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:09,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440883924] [2022-07-19 22:05:09,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440883924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:09,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:09,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 22:05:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478988558] [2022-07-19 22:05:09,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:09,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 22:05:09,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:09,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 22:05:09,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:05:09,725 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 22:05:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:10,131 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2022-07-19 22:05:10,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 22:05:10,133 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2022-07-19 22:05:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:10,133 INFO L225 Difference]: With dead ends: 127 [2022-07-19 22:05:10,133 INFO L226 Difference]: Without dead ends: 93 [2022-07-19 22:05:10,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:05:10,134 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:10,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 157 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:05:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-19 22:05:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-07-19 22:05:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 67 states have internal predecessors, (68), 14 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-19 22:05:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-07-19 22:05:10,141 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 56 [2022-07-19 22:05:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:10,141 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-07-19 22:05:10,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 22:05:10,141 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-07-19 22:05:10,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 22:05:10,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:10,142 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:10,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 22:05:10,143 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:10,143 INFO L85 PathProgramCache]: Analyzing trace with hash 237359553, now seen corresponding path program 1 times [2022-07-19 22:05:10,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:10,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804962916] [2022-07-19 22:05:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:10,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:10,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:10,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:10,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:10,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 22:05:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:10,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:05:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:10,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:05:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:10,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 22:05:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-19 22:05:10,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:10,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804962916] [2022-07-19 22:05:10,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804962916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:10,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:10,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 22:05:10,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303191960] [2022-07-19 22:05:10,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:10,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 22:05:10,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:10,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 22:05:10,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:05:10,465 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 22:05:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:10,861 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-07-19 22:05:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:05:10,862 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 59 [2022-07-19 22:05:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:10,863 INFO L225 Difference]: With dead ends: 97 [2022-07-19 22:05:10,863 INFO L226 Difference]: Without dead ends: 93 [2022-07-19 22:05:10,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-07-19 22:05:10,864 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 51 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:10,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 150 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:05:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-19 22:05:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-07-19 22:05:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-19 22:05:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2022-07-19 22:05:10,872 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 59 [2022-07-19 22:05:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:10,872 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2022-07-19 22:05:10,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 22:05:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-07-19 22:05:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-19 22:05:10,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:10,873 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 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] [2022-07-19 22:05:10,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 22:05:10,874 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:10,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:10,874 INFO L85 PathProgramCache]: Analyzing trace with hash 53156309, now seen corresponding path program 1 times [2022-07-19 22:05:10,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:10,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138545057] [2022-07-19 22:05:10,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:10,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:11,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:11,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:11,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:11,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:11,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 22:05:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:11,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:05:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:11,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:05:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:11,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 22:05:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:05:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:11,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 22:05:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:11,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 22:05:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 22:05:11,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:11,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138545057] [2022-07-19 22:05:11,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138545057] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:11,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565945359] [2022-07-19 22:05:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:11,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:11,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:11,294 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-19 22:05:11,305 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-19 22:05:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:11,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 2498 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-19 22:05:11,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:11,687 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 11 treesize of output 7 [2022-07-19 22:05:12,249 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 22:05:12,249 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 38 treesize of output 18 [2022-07-19 22:05:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 22:05:12,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:05:13,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565945359] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:13,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:05:13,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2022-07-19 22:05:13,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339784717] [2022-07-19 22:05:13,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:05:13,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 22:05:13,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:13,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 22:05:13,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=367, Unknown=1, NotChecked=0, Total=420 [2022-07-19 22:05:13,482 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) [2022-07-19 22:05:14,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:14,318 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2022-07-19 22:05:14,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-19 22:05:14,318 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) Word has length 76 [2022-07-19 22:05:14,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:14,319 INFO L225 Difference]: With dead ends: 142 [2022-07-19 22:05:14,319 INFO L226 Difference]: Without dead ends: 68 [2022-07-19 22:05:14,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=149, Invalid=1182, Unknown=1, NotChecked=0, Total=1332 [2022-07-19 22:05:14,320 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 88 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:14,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 317 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 622 Invalid, 0 Unknown, 236 Unchecked, 0.5s Time] [2022-07-19 22:05:14,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-19 22:05:14,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-19 22:05:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.0) internal successors, (47), 47 states have internal predecessors, (47), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 22:05:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-07-19 22:05:14,326 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 76 [2022-07-19 22:05:14,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:14,326 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-07-19 22:05:14,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) [2022-07-19 22:05:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-07-19 22:05:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-19 22:05:14,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:14,328 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:14,362 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-19 22:05:14,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:14,548 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:14,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:14,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2101457013, now seen corresponding path program 1 times [2022-07-19 22:05:14,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:14,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773583322] [2022-07-19 22:05:14,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:14,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:15,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:15,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:15,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:05:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:15,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:05:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:15,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:05:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:15,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:05:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:15,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:05:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:15,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:05:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:15,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:05:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:15,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:05:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:15,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:05:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 22:05:15,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:15,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773583322] [2022-07-19 22:05:15,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773583322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:15,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:15,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 22:05:15,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209921293] [2022-07-19 22:05:15,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:15,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 22:05:15,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:15,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 22:05:15,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:05:15,646 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 22:05:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:16,055 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-07-19 22:05:16,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 22:05:16,056 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 88 [2022-07-19 22:05:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:16,057 INFO L225 Difference]: With dead ends: 68 [2022-07-19 22:05:16,057 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 22:05:16,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:05:16,058 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:16,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 154 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:05:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 22:05:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 22:05:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 22:05:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 22:05:16,059 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2022-07-19 22:05:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:16,059 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 22:05:16,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 22:05:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 22:05:16,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 22:05:16,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 22:05:16,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 22:05:16,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 22:05:17,167 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-19 22:05:17,167 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-19 22:05:17,167 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-19 22:05:17,168 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-19 22:05:17,168 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-19 22:05:17,168 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:05:17,168 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-19 22:05:17,168 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-19 22:05:17,168 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:05:17,169 INFO L899 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2022-07-19 22:05:17,169 INFO L899 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2022-07-19 22:05:17,169 INFO L899 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2022-07-19 22:05:17,169 INFO L899 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2022-07-19 22:05:17,169 INFO L902 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7384 7388) the Hoare annotation is: true [2022-07-19 22:05:17,169 INFO L899 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2022-07-19 22:05:17,169 INFO L899 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2022-07-19 22:05:17,170 INFO L899 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2022-07-19 22:05:17,170 INFO L899 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2022-07-19 22:05:17,170 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7384 7388) no Hoare annotation was computed. [2022-07-19 22:05:17,170 INFO L899 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2022-07-19 22:05:17,170 INFO L899 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2022-07-19 22:05:17,170 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7384 7388) no Hoare annotation was computed. [2022-07-19 22:05:17,170 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-19 22:05:17,170 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-19 22:05:17,170 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-19 22:05:17,170 INFO L899 garLoopResultBuilder]: For program point L8256-2(line 8256) no Hoare annotation was computed. [2022-07-19 22:05:17,171 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 22:05:17,171 INFO L895 garLoopResultBuilder]: At program point L8256-1(line 8256) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset|))) (.cse1 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1| 1)) (.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse4)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0)) (.cse5 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|))) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse10 (<= 1 |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse2 .cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse4) 0) .cse5 .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| .cse9) .cse10) (and .cse0 .cse1 (not (= .cse9 0)) .cse2 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) .cse3 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) .cse10)))) [2022-07-19 22:05:17,171 INFO L895 garLoopResultBuilder]: At program point L8256(line 8256) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset|)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse0) 0) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse0)))) [2022-07-19 22:05:17,171 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-19 22:05:17,171 INFO L899 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2022-07-19 22:05:17,171 INFO L899 garLoopResultBuilder]: For program point L8252-1(line 8252) no Hoare annotation was computed. [2022-07-19 22:05:17,171 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-19 22:05:17,171 INFO L895 garLoopResultBuilder]: At program point L8252(line 8252) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) [2022-07-19 22:05:17,171 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse11 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse4 (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0)) (.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse3 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|))) (.cse8 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse9 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse11)) (.cse7 (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) (or (and .cse0 (not (= .cse1 0)) .cse2 .cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) (let ((.cse5 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0)) (.cse6 (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))) (or (and .cse4 .cse5 .cse6 .cse7) (and (or (not .cse4) (not .cse5)) (or (not .cse7) (not .cse6))))) (<= |ULTIMATE.start_assert_bytes_match_~len#1| (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~len#1| 18446744073709551616))) .cse8 .cse9 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse10) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse4 .cse0 .cse2 .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse11) 0) .cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse10 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= .cse1 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse7)))) [2022-07-19 22:05:17,172 INFO L895 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse9 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse3 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|))) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1212#1|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse7 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse9))) (or (and .cse0 (not (= .cse1 0)) .cse2 .cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) .cse4 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse5 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) 0))) (and (<= 0 (+ .cse5 (* 18446744073709551616 (div (* (- 1) .cse5) 18446744073709551616)))) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) .cse5)))) .cse6 .cse7 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse8) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse2 .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse9) 0) .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse8 (= .cse1 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|))))) [2022-07-19 22:05:17,172 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-19 22:05:17,172 INFO L899 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2022-07-19 22:05:17,172 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse0) 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-07-19 22:05:17,172 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 22:05:17,172 INFO L895 garLoopResultBuilder]: At program point L8257(lines 8251 8258) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse2 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|))) (or (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse4) (and .cse0 .cse1 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) .cse2 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7| Int)) (let ((.cse5 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7|) 0))) (and (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse5) 18446744073709551616)) .cse5)) (= .cse5 |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)))) .cse3 .cse4))) [2022-07-19 22:05:17,172 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 22:05:17,172 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 22:05:17,172 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-19 22:05:17,172 INFO L899 garLoopResultBuilder]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2022-07-19 22:05:17,172 INFO L899 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2022-07-19 22:05:17,172 INFO L902 garLoopResultBuilder]: At program point L8974(line 8974) the Hoare annotation is: true [2022-07-19 22:05:17,172 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse0) 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_#t~mem589#1| |ULTIMATE.start_assert_bytes_match_#t~mem588#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-07-19 22:05:17,173 INFO L902 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: true [2022-07-19 22:05:17,173 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse0) 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-07-19 22:05:17,173 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse8 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse8))) (or (and .cse0 (not (= .cse1 0)) .cse2 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse3 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) 0))) (and (<= 0 (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)))) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) .cse3)))) .cse4 .cse5 .cse6 .cse7) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse8) 0) .cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse7 (= .cse1 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|))))) [2022-07-19 22:05:17,173 INFO L899 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2022-07-19 22:05:17,173 INFO L895 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse3 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse3)) (.cse1 (<= 1 |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1211#1|)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse7 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1211#1| 1)) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|))) (or (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse3) 0) .cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse6 .cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse8 (= .cse9 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (and .cse0 (not (= .cse9 0)) .cse1 .cse2 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse10 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) 0))) (and (<= 0 (+ .cse10 (* 18446744073709551616 (div (* (- 1) .cse10) 18446744073709551616)))) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) .cse10)))) .cse4 .cse5 .cse6 .cse7 .cse8)))) [2022-07-19 22:05:17,173 INFO L899 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2022-07-19 22:05:17,173 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-19 22:05:17,173 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-19 22:05:17,173 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-19 22:05:17,173 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-19 22:05:17,173 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:05:17,173 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:05:17,173 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-19 22:05:17,176 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:17,178 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 22:05:17,193 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-07-19 22:05:17,194 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-07-19 22:05:17,194 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-07-19 22:05:17,195 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-07-19 22:05:17,195 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-07-19 22:05:17,195 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-07-19 22:05:17,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-07-19 22:05:17,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-07-19 22:05:17,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-07-19 22:05:17,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-07-19 22:05:17,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-07-19 22:05:17,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-07-19 22:05:17,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:05:17 BoogieIcfgContainer [2022-07-19 22:05:17,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 22:05:17,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 22:05:17,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 22:05:17,209 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 22:05:17,209 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:04:57" (3/4) ... [2022-07-19 22:05:17,217 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 22:05:17,222 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-19 22:05:17,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2022-07-19 22:05:17,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-19 22:05:17,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-19 22:05:17,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-19 22:05:17,240 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2022-07-19 22:05:17,242 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2022-07-19 22:05:17,243 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-07-19 22:05:17,244 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-19 22:05:17,245 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-19 22:05:17,246 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-19 22:05:17,246 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 22:05:17,247 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 22:05:17,279 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((array == 0 && cur == 0) && length == unknown-#res!len-unknown) && aws_byte_cursor_from_array_#res#1.ptr == 0) && !(cur == 0)) && bytes == 0) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(array == 0)) && array == bytes) && len == length) || (((((((cur == 0 && length == unknown-#res!len-unknown) && !(0 == bytes)) && !(aws_byte_cursor_from_array_#res#1.ptr == 0)) && !(cur == 0)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7 : int :: 0 <= 18446744073709551616 * (-1 * unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][0] / 18446744073709551616) + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][0] && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][0] == unknown-#res!len-unknown)) && !(array == 0)) && len == length) [2022-07-19 22:05:17,650 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 22:05:17,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 22:05:17,651 INFO L158 Benchmark]: Toolchain (without parser) took 24175.86ms. Allocated memory was 88.1MB in the beginning and 408.9MB in the end (delta: 320.9MB). Free memory was 62.7MB in the beginning and 225.8MB in the end (delta: -163.0MB). Peak memory consumption was 263.5MB. Max. memory is 16.1GB. [2022-07-19 22:05:17,651 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:05:17,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2132.36ms. Allocated memory was 88.1MB in the beginning and 159.4MB in the end (delta: 71.3MB). Free memory was 62.6MB in the beginning and 90.9MB in the end (delta: -28.3MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2022-07-19 22:05:17,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 173.63ms. Allocated memory is still 159.4MB. Free memory was 90.9MB in the beginning and 79.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 22:05:17,651 INFO L158 Benchmark]: Boogie Preprocessor took 70.12ms. Allocated memory is still 159.4MB. Free memory was 79.9MB in the beginning and 74.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 22:05:17,652 INFO L158 Benchmark]: RCFGBuilder took 1169.28ms. Allocated memory is still 159.4MB. Free memory was 74.1MB in the beginning and 90.3MB in the end (delta: -16.2MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2022-07-19 22:05:17,652 INFO L158 Benchmark]: TraceAbstraction took 20180.29ms. Allocated memory was 159.4MB in the beginning and 339.7MB in the end (delta: 180.4MB). Free memory was 89.3MB in the beginning and 86.1MB in the end (delta: 3.2MB). Peak memory consumption was 184.6MB. Max. memory is 16.1GB. [2022-07-19 22:05:17,652 INFO L158 Benchmark]: Witness Printer took 442.09ms. Allocated memory was 339.7MB in the beginning and 408.9MB in the end (delta: 69.2MB). Free memory was 86.1MB in the beginning and 225.8MB in the end (delta: -139.6MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2022-07-19 22:05:17,653 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2132.36ms. Allocated memory was 88.1MB in the beginning and 159.4MB in the end (delta: 71.3MB). Free memory was 62.6MB in the beginning and 90.9MB in the end (delta: -28.3MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 173.63ms. Allocated memory is still 159.4MB. Free memory was 90.9MB in the beginning and 79.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.12ms. Allocated memory is still 159.4MB. Free memory was 79.9MB in the beginning and 74.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1169.28ms. Allocated memory is still 159.4MB. Free memory was 74.1MB in the beginning and 90.3MB in the end (delta: -16.2MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20180.29ms. Allocated memory was 159.4MB in the beginning and 339.7MB in the end (delta: 180.4MB). Free memory was 89.3MB in the beginning and 86.1MB in the end (delta: 3.2MB). Peak memory consumption was 184.6MB. Max. memory is 16.1GB. * Witness Printer took 442.09ms. Allocated memory was 339.7MB in the beginning and 408.9MB in the end (delta: 69.2MB). Free memory was 86.1MB in the beginning and 225.8MB in the end (delta: -139.6MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1026 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 973 mSDsluCounter, 3743 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 594 IncrementalHoareTripleChecker+Unchecked, 2693 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5736 IncrementalHoareTripleChecker+Invalid, 6718 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 1050 mSDtfsCounter, 5736 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 763 GetRequests, 466 SyntacticMatches, 16 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=12, InterpolantAutomatonStates: 208, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 86 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 101 PreInvPairs, 125 NumberOfFragments, 1082 HoareAnnotationTreeSize, 101 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1855 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 1046 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1025 ConstructedInterpolants, 44 QuantifiedInterpolants, 4477 SizeOfPredicates, 37 NumberOfNonLiveVariables, 7363 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 320/362 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8974]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8251]: Loop Invariant [2022-07-19 22:05:17,662 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-07-19 22:05:17,662 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-07-19 22:05:17,662 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-07-19 22:05:17,662 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-07-19 22:05:17,662 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-07-19 22:05:17,663 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-07-19 22:05:17,663 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-07-19 22:05:17,664 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-07-19 22:05:17,664 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-07-19 22:05:17,664 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-07-19 22:05:17,664 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-07-19 22:05:17,664 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] Derived loop invariant: (((((((((array == 0 && cur == 0) && length == unknown-#res!len-unknown) && aws_byte_cursor_from_array_#res#1.ptr == 0) && !(cur == 0)) && bytes == 0) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(array == 0)) && array == bytes) && len == length) || (((((((cur == 0 && length == unknown-#res!len-unknown) && !(0 == bytes)) && !(aws_byte_cursor_from_array_#res#1.ptr == 0)) && !(cur == 0)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7 : int :: 0 <= 18446744073709551616 * (-1 * unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][0] / 18446744073709551616) + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][0] && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][0] == unknown-#res!len-unknown)) && !(array == 0)) && len == length) RESULT: Ultimate proved your program to be correct! [2022-07-19 22:05:17,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE