./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_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 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 22:13:00,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:13:00,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:13:00,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:13:00,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:13:00,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:13:00,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:13:00,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:13:00,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:13:00,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:13:00,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:13:00,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:13:00,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:13:00,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:13:00,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:13:00,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:13:00,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:13:00,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:13:00,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:13:00,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:13:00,792 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:13:00,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:13:00,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:13:00,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:13:00,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:13:00,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:13:00,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:13:00,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:13:00,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:13:00,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:13:00,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:13:00,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:13:00,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:13:00,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:13:00,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:13:00,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:13:00,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:13:00,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:13:00,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:13:00,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:13:00,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:13:00,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:13:00,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:13:00,852 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:13:00,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:13:00,853 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:13:00,853 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:13:00,854 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:13:00,854 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:13:00,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:13:00,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:13:00,855 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:13:00,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:13:00,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:13:00,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:13:00,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:13:00,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:13:00,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:13:00,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:13:00,857 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:13:00,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:13:00,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:13:00,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:13:00,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:13:00,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:13:00,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:13:00,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:13:00,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:13:00,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:13:00,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:13:00,859 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:13:00,860 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:13:00,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:13:00,860 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 -> 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 [2022-07-22 22:13:01,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:13:01,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:13:01,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:13:01,106 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:13:01,106 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:13:01,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2022-07-22 22:13:01,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8997c7be9/52bff698d82a493ab07efe8c032bc01a/FLAGb00df9fa3 [2022-07-22 22:13:01,836 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:13:01,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2022-07-22 22:13:01,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8997c7be9/52bff698d82a493ab07efe8c032bc01a/FLAGb00df9fa3 [2022-07-22 22:13:01,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8997c7be9/52bff698d82a493ab07efe8c032bc01a [2022-07-22 22:13:01,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:13:01,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:13:01,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:13:01,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:13:01,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:13:01,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:13:01" (1/1) ... [2022-07-22 22:13:01,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473f7ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:13:01, skipping insertion in model container [2022-07-22 22:13:01,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:13:01" (1/1) ... [2022-07-22 22:13:01,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:13:02,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:13:02,296 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_buf_from_empty_array_harness.i[4503,4516] [2022-07-22 22:13:02,303 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_buf_from_empty_array_harness.i[4563,4576] [2022-07-22 22:13:03,050 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,051 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,052 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,052 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,053 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,063 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,072 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,074 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,075 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,323 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:13:03,324 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:13:03,325 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:13:03,326 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:13:03,329 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:13:03,332 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:13:03,332 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:13:03,333 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:13:03,334 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:13:03,335 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:13:03,443 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:13:03,527 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,527 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:13:03,658 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:13:03,668 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_buf_from_empty_array_harness.i[4503,4516] [2022-07-22 22:13:03,669 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_buf_from_empty_array_harness.i[4563,4576] [2022-07-22 22:13:03,697 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,697 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,697 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,698 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,698 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,703 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,704 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,705 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,705 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,728 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:13:03,729 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:13:03,730 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:13:03,731 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:13:03,731 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:13:03,732 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:13:03,732 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:13:03,732 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:13:03,733 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:13:03,733 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:13:03,749 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:13:03,832 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,833 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:13:03,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:13:04,079 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:13:04,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:13:04 WrapperNode [2022-07-22 22:13:04,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:13:04,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:13:04,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:13:04,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:13:04,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:13:04" (1/1) ... [2022-07-22 22:13:04,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:13:04" (1/1) ... [2022-07-22 22:13:04,256 INFO L137 Inliner]: procedures = 690, calls = 2614, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 794 [2022-07-22 22:13:04,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:13:04,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:13:04,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:13:04,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:13:04,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:13:04" (1/1) ... [2022-07-22 22:13:04,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:13:04" (1/1) ... [2022-07-22 22:13:04,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:13:04" (1/1) ... [2022-07-22 22:13:04,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:13:04" (1/1) ... [2022-07-22 22:13:04,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:13:04" (1/1) ... [2022-07-22 22:13:04,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:13:04" (1/1) ... [2022-07-22 22:13:04,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:13:04" (1/1) ... [2022-07-22 22:13:04,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:13:04,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:13:04,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:13:04,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:13:04,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:13:04" (1/1) ... [2022-07-22 22:13:04,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:13:04,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:13:04,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 22:13:04,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 22:13:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-22 22:13:04,408 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-22 22:13:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 22:13:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:13:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 22:13:04,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 22:13:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:13:04,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:13:04,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 22:13:04,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:13:04,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:13:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-22 22:13:04,412 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-22 22:13:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 22:13:04,413 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 22:13:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 22:13:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 22:13:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:13:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-22 22:13:04,414 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-22 22:13:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 22:13:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:13:04,669 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:13:04,671 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:13:05,615 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:13:05,623 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:13:05,624 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 22:13:05,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:13:05 BoogieIcfgContainer [2022-07-22 22:13:05,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:13:05,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:13:05,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:13:05,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:13:05,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:13:01" (1/3) ... [2022-07-22 22:13:05,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2036ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:13:05, skipping insertion in model container [2022-07-22 22:13:05,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:13:04" (2/3) ... [2022-07-22 22:13:05,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2036ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:13:05, skipping insertion in model container [2022-07-22 22:13:05,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:13:05" (3/3) ... [2022-07-22 22:13:05,636 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2022-07-22 22:13:05,652 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:13:05,652 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:13:05,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:13:05,720 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@5264eac5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1876cfea [2022-07-22 22:13:05,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:13:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-22 22:13:05,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 22:13:05,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:05,732 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-22 22:13:05,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:05,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1597769755, now seen corresponding path program 1 times [2022-07-22 22:13:05,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:05,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230205670] [2022-07-22 22:13:05,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:05,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,330 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-22 22:13:06,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:06,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230205670] [2022-07-22 22:13:06,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230205670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:06,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:06,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 22:13:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871667418] [2022-07-22 22:13:06,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:06,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:13:06,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:06,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:13:06,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:13:06,363 INFO L87 Difference]: Start difference. First operand has 71 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-22 22:13:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:06,531 INFO L93 Difference]: Finished difference Result 137 states and 186 transitions. [2022-07-22 22:13:06,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:13:06,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 31 [2022-07-22 22:13:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:06,541 INFO L225 Difference]: With dead ends: 137 [2022-07-22 22:13:06,546 INFO L226 Difference]: Without dead ends: 64 [2022-07-22 22:13:06,550 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-22 22:13:06,558 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:06,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 109 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:13:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-22 22:13:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-22 22:13:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-22 22:13:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-07-22 22:13:06,598 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 31 [2022-07-22 22:13:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:06,599 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-07-22 22:13:06,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-22 22:13:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-07-22 22:13:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 22:13:06,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:06,601 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-22 22:13:06,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 22:13:06,602 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:06,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:06,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1816677797, now seen corresponding path program 1 times [2022-07-22 22:13:06,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:06,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671502860] [2022-07-22 22:13:06,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:06,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,862 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-22 22:13:06,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:06,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671502860] [2022-07-22 22:13:06,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671502860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:06,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:06,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:13:06,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466131341] [2022-07-22 22:13:06,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:06,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:13:06,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:06,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:13:06,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:13:06,866 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-22 22:13:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:07,078 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2022-07-22 22:13:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:13:07,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 31 [2022-07-22 22:13:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:07,081 INFO L225 Difference]: With dead ends: 117 [2022-07-22 22:13:07,081 INFO L226 Difference]: Without dead ends: 67 [2022-07-22 22:13:07,082 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-22 22:13:07,083 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:07,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 144 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:13:07,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-22 22:13:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-07-22 22:13:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 48 states have internal predecessors, (55), 14 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-22 22:13:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2022-07-22 22:13:07,094 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 31 [2022-07-22 22:13:07,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:07,094 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2022-07-22 22:13:07,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-22 22:13:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-07-22 22:13:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 22:13:07,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:07,096 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-22 22:13:07,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 22:13:07,096 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:07,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:07,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1185357712, now seen corresponding path program 1 times [2022-07-22 22:13:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:07,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476482674] [2022-07-22 22:13:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:07,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,408 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-22 22:13:07,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:07,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476482674] [2022-07-22 22:13:07,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476482674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:07,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:07,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:13:07,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163251399] [2022-07-22 22:13:07,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:07,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:13:07,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:07,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:13:07,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:13:07,411 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 6 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-22 22:13:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:07,778 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2022-07-22 22:13:07,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:13:07,779 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 6 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-22 22:13:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:07,780 INFO L225 Difference]: With dead ends: 79 [2022-07-22 22:13:07,780 INFO L226 Difference]: Without dead ends: 77 [2022-07-22 22:13:07,781 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-22 22:13:07,782 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 59 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:07,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 282 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:13:07,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-22 22:13:07,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2022-07-22 22:13:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 55 states have internal predecessors, (61), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-07-22 22:13:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2022-07-22 22:13:07,792 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 37 [2022-07-22 22:13:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:07,792 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2022-07-22 22:13:07,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 6 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-22 22:13:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-07-22 22:13:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 22:13:07,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:07,794 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, 1, 1, 1, 1] [2022-07-22 22:13:07,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 22:13:07,795 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:07,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:07,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1529203256, now seen corresponding path program 1 times [2022-07-22 22:13:07,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:07,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209602801] [2022-07-22 22:13:07,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:07,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:08,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:08,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:08,192 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-22 22:13:08,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:08,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209602801] [2022-07-22 22:13:08,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209602801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:08,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:08,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:13:08,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579062493] [2022-07-22 22:13:08,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:08,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:13:08,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:08,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:13:08,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:13:08,195 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-22 22:13:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:08,607 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2022-07-22 22:13:08,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:13:08,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 41 [2022-07-22 22:13:08,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:08,609 INFO L225 Difference]: With dead ends: 145 [2022-07-22 22:13:08,610 INFO L226 Difference]: Without dead ends: 88 [2022-07-22 22:13:08,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:13:08,611 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 92 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:08,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 234 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:13:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-22 22:13:08,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2022-07-22 22:13:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-07-22 22:13:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2022-07-22 22:13:08,620 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 41 [2022-07-22 22:13:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:08,621 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2022-07-22 22:13:08,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-22 22:13:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-07-22 22:13:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 22:13:08,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:08,622 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, 1, 1, 1, 1] [2022-07-22 22:13:08,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 22:13:08,623 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:08,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:08,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1787368694, now seen corresponding path program 1 times [2022-07-22 22:13:08,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:08,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684488095] [2022-07-22 22:13:08,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:08,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 22:13:09,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:09,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684488095] [2022-07-22 22:13:09,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684488095] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:13:09,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931014994] [2022-07-22 22:13:09,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:09,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:13:09,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:13:09,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-22 22:13:09,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 22:13:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 2418 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-22 22:13:09,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:13:10,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:13:10,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:13:10,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:13:10,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-22 22:13:10,510 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-22 22:13:10,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:13:10,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931014994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:10,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:13:10,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 24 [2022-07-22 22:13:10,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907331346] [2022-07-22 22:13:10,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:10,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:13:10,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:10,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:13:10,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-07-22 22:13:10,513 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-22 22:13:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:10,597 INFO L93 Difference]: Finished difference Result 173 states and 213 transitions. [2022-07-22 22:13:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:13:10,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 41 [2022-07-22 22:13:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:10,599 INFO L225 Difference]: With dead ends: 173 [2022-07-22 22:13:10,599 INFO L226 Difference]: Without dead ends: 95 [2022-07-22 22:13:10,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2022-07-22 22:13:10,601 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 22 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:10,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 367 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 44 Unchecked, 0.0s Time] [2022-07-22 22:13:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-22 22:13:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-07-22 22:13:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 70 states have internal predecessors, (80), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (19), 14 states have call predecessors, (19), 15 states have call successors, (19) [2022-07-22 22:13:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2022-07-22 22:13:10,611 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 41 [2022-07-22 22:13:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:10,612 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2022-07-22 22:13:10,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-22 22:13:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2022-07-22 22:13:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 22:13:10,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:10,614 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, 1, 1, 1, 1] [2022-07-22 22:13:10,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 22:13:10,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:13:10,828 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:10,829 INFO L85 PathProgramCache]: Analyzing trace with hash 199020792, now seen corresponding path program 1 times [2022-07-22 22:13:10,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:10,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761326370] [2022-07-22 22:13:10,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:10,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:11,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:11,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:11,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:11,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:11,066 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-22 22:13:11,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:11,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761326370] [2022-07-22 22:13:11,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761326370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:11,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:11,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:13:11,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957306688] [2022-07-22 22:13:11,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:11,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:13:11,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:11,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:13:11,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:13:11,069 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-22 22:13:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:11,323 INFO L93 Difference]: Finished difference Result 199 states and 254 transitions. [2022-07-22 22:13:11,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:13:11,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 41 [2022-07-22 22:13:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:11,324 INFO L225 Difference]: With dead ends: 199 [2022-07-22 22:13:11,324 INFO L226 Difference]: Without dead ends: 133 [2022-07-22 22:13:11,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:13:11,326 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:11,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 182 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:13:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-22 22:13:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 94. [2022-07-22 22:13:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 72 states have internal predecessors, (82), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (19), 14 states have call predecessors, (19), 15 states have call successors, (19) [2022-07-22 22:13:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2022-07-22 22:13:11,338 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 41 [2022-07-22 22:13:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:11,338 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2022-07-22 22:13:11,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-22 22:13:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-07-22 22:13:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 22:13:11,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:11,340 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, 1, 1, 1, 1] [2022-07-22 22:13:11,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 22:13:11,340 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:11,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:11,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1080842886, now seen corresponding path program 1 times [2022-07-22 22:13:11,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:11,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884644044] [2022-07-22 22:13:11,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:11,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:11,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:11,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:11,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:11,547 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-22 22:13:11,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:11,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884644044] [2022-07-22 22:13:11,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884644044] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:11,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:11,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:13:11,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027353559] [2022-07-22 22:13:11,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:11,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:13:11,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:11,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:13:11,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:13:11,550 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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-22 22:13:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:11,783 INFO L93 Difference]: Finished difference Result 178 states and 224 transitions. [2022-07-22 22:13:11,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:13:11,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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 41 [2022-07-22 22:13:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:11,785 INFO L225 Difference]: With dead ends: 178 [2022-07-22 22:13:11,785 INFO L226 Difference]: Without dead ends: 115 [2022-07-22 22:13:11,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:13:11,786 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 63 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:11,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 163 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:13:11,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-22 22:13:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2022-07-22 22:13:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 79 states have internal predecessors, (89), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2022-07-22 22:13:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2022-07-22 22:13:11,795 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 41 [2022-07-22 22:13:11,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:11,795 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2022-07-22 22:13:11,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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-22 22:13:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2022-07-22 22:13:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 22:13:11,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:11,797 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, 1, 1, 1, 1] [2022-07-22 22:13:11,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 22:13:11,797 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:11,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:11,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2006223412, now seen corresponding path program 1 times [2022-07-22 22:13:11,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:11,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129581054] [2022-07-22 22:13:11,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:11,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:12,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:12,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:12,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:12,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:12,164 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-22 22:13:12,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:12,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129581054] [2022-07-22 22:13:12,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129581054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:12,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:12,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:13:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602115120] [2022-07-22 22:13:12,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:12,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:13:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:12,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:13:12,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:13:12,167 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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-22 22:13:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:12,712 INFO L93 Difference]: Finished difference Result 200 states and 249 transitions. [2022-07-22 22:13:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:13:12,712 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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 41 [2022-07-22 22:13:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:12,714 INFO L225 Difference]: With dead ends: 200 [2022-07-22 22:13:12,714 INFO L226 Difference]: Without dead ends: 130 [2022-07-22 22:13:12,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:13:12,715 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 113 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:12,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 245 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:13:12,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-22 22:13:12,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2022-07-22 22:13:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 98 states have internal predecessors, (113), 16 states have call successors, (16), 7 states have call predecessors, (16), 10 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-22 22:13:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2022-07-22 22:13:12,723 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 41 [2022-07-22 22:13:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:12,723 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2022-07-22 22:13:12,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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-22 22:13:12,723 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2022-07-22 22:13:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 22:13:12,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:12,725 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, 1, 1, 1, 1] [2022-07-22 22:13:12,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 22:13:12,725 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:12,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:12,725 INFO L85 PathProgramCache]: Analyzing trace with hash 726359734, now seen corresponding path program 1 times [2022-07-22 22:13:12,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:12,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556086413] [2022-07-22 22:13:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:12,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:12,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:12,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:12,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:12,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:12,977 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-22 22:13:12,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:12,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556086413] [2022-07-22 22:13:12,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556086413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:12,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:12,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:13:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262187300] [2022-07-22 22:13:12,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:12,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:13:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:13:12,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:13:12,980 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-22 22:13:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:13,401 INFO L93 Difference]: Finished difference Result 230 states and 286 transitions. [2022-07-22 22:13:13,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:13:13,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 41 [2022-07-22 22:13:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:13,403 INFO L225 Difference]: With dead ends: 230 [2022-07-22 22:13:13,403 INFO L226 Difference]: Without dead ends: 136 [2022-07-22 22:13:13,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:13:13,404 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 109 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:13,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 245 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:13:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-22 22:13:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 117. [2022-07-22 22:13:13,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.211111111111111) internal successors, (109), 95 states have internal predecessors, (109), 16 states have call successors, (16), 7 states have call predecessors, (16), 10 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-22 22:13:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2022-07-22 22:13:13,412 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 41 [2022-07-22 22:13:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:13,413 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2022-07-22 22:13:13,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-22 22:13:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2022-07-22 22:13:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 22:13:13,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:13,414 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, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:13,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 22:13:13,415 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:13,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:13,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1315800189, now seen corresponding path program 1 times [2022-07-22 22:13:13,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:13,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766625094] [2022-07-22 22:13:13,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:13,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:13,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:13,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:13,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:13,647 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-22 22:13:13,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:13,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766625094] [2022-07-22 22:13:13,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766625094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:13,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:13,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 22:13:13,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413602444] [2022-07-22 22:13:13,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:13,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:13:13,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:13,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:13:13,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:13:13,649 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 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-22 22:13:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:14,040 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2022-07-22 22:13:14,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:13:14,040 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 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 43 [2022-07-22 22:13:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:14,042 INFO L225 Difference]: With dead ends: 145 [2022-07-22 22:13:14,042 INFO L226 Difference]: Without dead ends: 143 [2022-07-22 22:13:14,043 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-22 22:13:14,043 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 63 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:14,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 347 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:13:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-22 22:13:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2022-07-22 22:13:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 97 states have (on average 1.1958762886597938) internal successors, (116), 103 states have internal predecessors, (116), 16 states have call successors, (16), 7 states have call predecessors, (16), 11 states have return successors, (25), 14 states have call predecessors, (25), 15 states have call successors, (25) [2022-07-22 22:13:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2022-07-22 22:13:14,053 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 43 [2022-07-22 22:13:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:14,053 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2022-07-22 22:13:14,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 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-22 22:13:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2022-07-22 22:13:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 22:13:14,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:14,055 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, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:14,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 22:13:14,055 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2016864767, now seen corresponding path program 1 times [2022-07-22 22:13:14,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:14,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538743798] [2022-07-22 22:13:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:14,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:14,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:14,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:14,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:14,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:14,365 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-22 22:13:14,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:14,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538743798] [2022-07-22 22:13:14,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538743798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:14,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:14,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 22:13:14,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363204044] [2022-07-22 22:13:14,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:14,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:13:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:14,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:13:14,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:13:14,367 INFO L87 Difference]: Start difference. First operand 125 states and 157 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 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-22 22:13:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:15,072 INFO L93 Difference]: Finished difference Result 153 states and 185 transitions. [2022-07-22 22:13:15,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 22:13:15,073 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 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 43 [2022-07-22 22:13:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:15,076 INFO L225 Difference]: With dead ends: 153 [2022-07-22 22:13:15,076 INFO L226 Difference]: Without dead ends: 151 [2022-07-22 22:13:15,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2022-07-22 22:13:15,077 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 114 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:15,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 401 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:13:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-22 22:13:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 117. [2022-07-22 22:13:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.2) internal successors, (108), 95 states have internal predecessors, (108), 16 states have call successors, (16), 7 states have call predecessors, (16), 10 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-22 22:13:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2022-07-22 22:13:15,092 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 43 [2022-07-22 22:13:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:15,093 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2022-07-22 22:13:15,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 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-22 22:13:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2022-07-22 22:13:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 22:13:15,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:15,094 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, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:15,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 22:13:15,095 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1260426877, now seen corresponding path program 1 times [2022-07-22 22:13:15,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:15,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011916033] [2022-07-22 22:13:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:15,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:15,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:15,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:15,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:15,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:15,351 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-22 22:13:15,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:15,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011916033] [2022-07-22 22:13:15,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011916033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:15,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:15,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:13:15,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541173624] [2022-07-22 22:13:15,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:15,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:13:15,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:15,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:13:15,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:13:15,353 INFO L87 Difference]: Start difference. First operand 117 states and 147 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-22 22:13:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:15,657 INFO L93 Difference]: Finished difference Result 224 states and 273 transitions. [2022-07-22 22:13:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:13:15,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 43 [2022-07-22 22:13:15,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:15,659 INFO L225 Difference]: With dead ends: 224 [2022-07-22 22:13:15,659 INFO L226 Difference]: Without dead ends: 133 [2022-07-22 22:13:15,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:13:15,660 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:15,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 215 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:13:15,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-22 22:13:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2022-07-22 22:13:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 89 states have internal predecessors, (103), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2022-07-22 22:13:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 137 transitions. [2022-07-22 22:13:15,666 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 137 transitions. Word has length 43 [2022-07-22 22:13:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:15,666 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 137 transitions. [2022-07-22 22:13:15,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-22 22:13:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2022-07-22 22:13:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-22 22:13:15,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:15,667 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, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:15,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 22:13:15,668 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:15,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:15,668 INFO L85 PathProgramCache]: Analyzing trace with hash 707087091, now seen corresponding path program 1 times [2022-07-22 22:13:15,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:15,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313308241] [2022-07-22 22:13:15,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:15,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:15,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:15,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:15,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:15,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:15,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:13:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:15,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:13:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 22:13:15,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:15,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313308241] [2022-07-22 22:13:15,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313308241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:13:15,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228619459] [2022-07-22 22:13:15,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:15,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:13:15,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:13:15,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:13:15,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 22:13:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:16,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 2456 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 22:13:16,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:13:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 22:13:16,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:13:16,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228619459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:16,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:13:16,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 22:13:16,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309544913] [2022-07-22 22:13:16,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:16,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:13:16,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:16,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:13:16,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:13:16,250 INFO L87 Difference]: Start difference. First operand 110 states and 137 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-22 22:13:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:16,298 INFO L93 Difference]: Finished difference Result 198 states and 247 transitions. [2022-07-22 22:13:16,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:13:16,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 50 [2022-07-22 22:13:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:16,300 INFO L225 Difference]: With dead ends: 198 [2022-07-22 22:13:16,300 INFO L226 Difference]: Without dead ends: 114 [2022-07-22 22:13:16,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:13:16,301 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 20 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:16,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 232 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:13:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-22 22:13:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2022-07-22 22:13:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.188235294117647) internal successors, (101), 89 states have internal predecessors, (101), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2022-07-22 22:13:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2022-07-22 22:13:16,307 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 50 [2022-07-22 22:13:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:16,307 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2022-07-22 22:13:16,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-22 22:13:16,307 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2022-07-22 22:13:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-22 22:13:16,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:16,308 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, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:16,352 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-22 22:13:16,527 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,SelfDestructingSolverStorable12 [2022-07-22 22:13:16,528 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:16,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1480660857, now seen corresponding path program 1 times [2022-07-22 22:13:16,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:16,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294729665] [2022-07-22 22:13:16,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:16,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:16,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:16,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:16,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:13:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:13:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:16,695 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-22 22:13:16,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:16,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294729665] [2022-07-22 22:13:16,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294729665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:16,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:16,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:13:16,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651293461] [2022-07-22 22:13:16,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:16,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:13:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:16,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:13:16,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:13:16,698 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-22 22:13:16,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:16,860 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2022-07-22 22:13:16,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:13:16,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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 50 [2022-07-22 22:13:16,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:16,861 INFO L225 Difference]: With dead ends: 142 [2022-07-22 22:13:16,861 INFO L226 Difference]: Without dead ends: 110 [2022-07-22 22:13:16,861 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-22 22:13:16,862 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 66 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:16,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 122 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:13:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-22 22:13:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-07-22 22:13:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2022-07-22 22:13:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2022-07-22 22:13:16,868 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 50 [2022-07-22 22:13:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:16,868 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2022-07-22 22:13:16,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-22 22:13:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2022-07-22 22:13:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-22 22:13:16,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:16,869 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2022-07-22 22:13:16,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 22:13:16,869 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:16,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:16,870 INFO L85 PathProgramCache]: Analyzing trace with hash 973183812, now seen corresponding path program 1 times [2022-07-22 22:13:16,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:16,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917149142] [2022-07-22 22:13:16,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:16,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:13:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:13:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,077 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-22 22:13:17,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:17,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917149142] [2022-07-22 22:13:17,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917149142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:17,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:17,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:13:17,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140876632] [2022-07-22 22:13:17,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:17,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:13:17,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:17,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:13:17,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:13:17,080 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 6 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-22 22:13:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:17,369 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2022-07-22 22:13:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:13:17,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 6 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 56 [2022-07-22 22:13:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:17,370 INFO L225 Difference]: With dead ends: 118 [2022-07-22 22:13:17,370 INFO L226 Difference]: Without dead ends: 116 [2022-07-22 22:13:17,370 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-22 22:13:17,371 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 56 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:17,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 281 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:13:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-22 22:13:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-07-22 22:13:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 92 states have internal predecessors, (103), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2022-07-22 22:13:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 139 transitions. [2022-07-22 22:13:17,376 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 139 transitions. Word has length 56 [2022-07-22 22:13:17,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:17,376 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 139 transitions. [2022-07-22 22:13:17,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 6 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-22 22:13:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 139 transitions. [2022-07-22 22:13:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 22:13:17,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:17,377 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, 1, 1, 1, 1] [2022-07-22 22:13:17,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 22:13:17,377 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:17,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:17,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1607419124, now seen corresponding path program 1 times [2022-07-22 22:13:17,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:17,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403300933] [2022-07-22 22:13:17,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:17,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:13:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:13:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:17,677 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-22 22:13:17,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:17,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403300933] [2022-07-22 22:13:17,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403300933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:17,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:17,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:13:17,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696217839] [2022-07-22 22:13:17,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:17,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:13:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:17,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:13:17,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:13:17,679 INFO L87 Difference]: Start difference. First operand 115 states and 139 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 22:13:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:18,074 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2022-07-22 22:13:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:13:18,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 60 [2022-07-22 22:13:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:18,076 INFO L225 Difference]: With dead ends: 163 [2022-07-22 22:13:18,076 INFO L226 Difference]: Without dead ends: 129 [2022-07-22 22:13:18,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-07-22 22:13:18,077 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 101 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:18,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 160 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:13:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-22 22:13:18,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2022-07-22 22:13:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.1555555555555554) internal successors, (104), 94 states have internal predecessors, (104), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2022-07-22 22:13:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2022-07-22 22:13:18,083 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 140 transitions. Word has length 60 [2022-07-22 22:13:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:18,083 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 140 transitions. [2022-07-22 22:13:18,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 22:13:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 140 transitions. [2022-07-22 22:13:18,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 22:13:18,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:18,085 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, 1, 1, 1, 1] [2022-07-22 22:13:18,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 22:13:18,085 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:18,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:18,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1349253686, now seen corresponding path program 1 times [2022-07-22 22:13:18,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:18,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099411610] [2022-07-22 22:13:18,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:18,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:18,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:18,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:18,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:18,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:18,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:13:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:18,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:13:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:18,530 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-22 22:13:18,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:18,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099411610] [2022-07-22 22:13:18,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099411610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:18,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:18,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 22:13:18,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407841872] [2022-07-22 22:13:18,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:18,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 22:13:18,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:18,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 22:13:18,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:13:18,531 INFO L87 Difference]: Start difference. First operand 117 states and 140 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-22 22:13:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:19,241 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2022-07-22 22:13:19,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 22:13:19,241 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 60 [2022-07-22 22:13:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:19,246 INFO L225 Difference]: With dead ends: 173 [2022-07-22 22:13:19,246 INFO L226 Difference]: Without dead ends: 144 [2022-07-22 22:13:19,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:13:19,247 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 150 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:19,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 185 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 22:13:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-22 22:13:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2022-07-22 22:13:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 102 states have internal predecessors, (111), 18 states have call successors, (18), 8 states have call predecessors, (18), 11 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2022-07-22 22:13:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 154 transitions. [2022-07-22 22:13:19,259 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 154 transitions. Word has length 60 [2022-07-22 22:13:19,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:19,259 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 154 transitions. [2022-07-22 22:13:19,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-22 22:13:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 154 transitions. [2022-07-22 22:13:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 22:13:19,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:19,261 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 22:13:19,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 22:13:19,261 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:19,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1665849932, now seen corresponding path program 1 times [2022-07-22 22:13:19,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:19,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363096012] [2022-07-22 22:13:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:19,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:19,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:19,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:19,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:19,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:19,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:13:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:19,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:13:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:19,556 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-22 22:13:19,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:19,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363096012] [2022-07-22 22:13:19,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363096012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:19,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:19,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 22:13:19,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118746814] [2022-07-22 22:13:19,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:19,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:13:19,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:19,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:13:19,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:13:19,558 INFO L87 Difference]: Start difference. First operand 127 states and 154 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 22:13:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:20,029 INFO L93 Difference]: Finished difference Result 162 states and 194 transitions. [2022-07-22 22:13:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:13:20,030 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 60 [2022-07-22 22:13:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:20,031 INFO L225 Difference]: With dead ends: 162 [2022-07-22 22:13:20,031 INFO L226 Difference]: Without dead ends: 119 [2022-07-22 22:13:20,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-07-22 22:13:20,033 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 124 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:20,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 181 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:13:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-22 22:13:20,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-22 22:13:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.1123595505617978) internal successors, (99), 94 states have internal predecessors, (99), 18 states have call successors, (18), 8 states have call predecessors, (18), 11 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2022-07-22 22:13:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2022-07-22 22:13:20,043 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 60 [2022-07-22 22:13:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:20,043 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2022-07-22 22:13:20,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 22:13:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2022-07-22 22:13:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 22:13:20,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:20,044 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 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] [2022-07-22 22:13:20,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 22:13:20,045 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:20,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:20,045 INFO L85 PathProgramCache]: Analyzing trace with hash 127651990, now seen corresponding path program 1 times [2022-07-22 22:13:20,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:20,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393276624] [2022-07-22 22:13:20,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:20,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:13:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:13:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:13:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 22:13:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:20,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393276624] [2022-07-22 22:13:20,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393276624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:20,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:20,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:13:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803704089] [2022-07-22 22:13:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:20,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:13:20,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:20,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:13:20,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:13:20,270 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 22:13:20,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:20,582 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2022-07-22 22:13:20,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:13:20,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2022-07-22 22:13:20,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:20,583 INFO L225 Difference]: With dead ends: 125 [2022-07-22 22:13:20,583 INFO L226 Difference]: Without dead ends: 123 [2022-07-22 22:13:20,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:13:20,584 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 53 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:20,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 179 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:13:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-22 22:13:20,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-22 22:13:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 92 states have (on average 1.108695652173913) internal successors, (102), 97 states have internal predecessors, (102), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2022-07-22 22:13:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2022-07-22 22:13:20,593 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 62 [2022-07-22 22:13:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:20,593 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2022-07-22 22:13:20,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 22:13:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2022-07-22 22:13:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 22:13:20,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:20,594 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 22:13:20,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 22:13:20,594 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:20,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:20,595 INFO L85 PathProgramCache]: Analyzing trace with hash -554307627, now seen corresponding path program 1 times [2022-07-22 22:13:20,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:20,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909549381] [2022-07-22 22:13:20,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:20,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:13:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:13:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:20,826 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-22 22:13:20,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:20,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909549381] [2022-07-22 22:13:20,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909549381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:20,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:20,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 22:13:20,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074311626] [2022-07-22 22:13:20,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:20,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:13:20,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:20,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:13:20,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:13:20,829 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 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-22 22:13:21,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:21,167 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2022-07-22 22:13:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:13:21,168 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 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 62 [2022-07-22 22:13:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:21,169 INFO L225 Difference]: With dead ends: 131 [2022-07-22 22:13:21,169 INFO L226 Difference]: Without dead ends: 129 [2022-07-22 22:13:21,169 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-22 22:13:21,170 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 60 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:21,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 346 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:13:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-22 22:13:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2022-07-22 22:13:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 92 states have (on average 1.108695652173913) internal successors, (102), 97 states have internal predecessors, (102), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2022-07-22 22:13:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2022-07-22 22:13:21,178 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 62 [2022-07-22 22:13:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:21,178 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2022-07-22 22:13:21,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 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-22 22:13:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2022-07-22 22:13:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 22:13:21,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:21,180 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 22:13:21,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 22:13:21,180 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:21,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:21,180 INFO L85 PathProgramCache]: Analyzing trace with hash 146756951, now seen corresponding path program 1 times [2022-07-22 22:13:21,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:21,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5720511] [2022-07-22 22:13:21,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:21,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:21,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:21,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:21,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:21,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:21,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:13:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:21,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:13:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:21,417 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-22 22:13:21,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:21,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5720511] [2022-07-22 22:13:21,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5720511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:21,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:21,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:13:21,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263918051] [2022-07-22 22:13:21,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:21,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:13:21,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:21,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:13:21,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:13:21,419 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 22:13:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:21,811 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2022-07-22 22:13:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:13:21,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 62 [2022-07-22 22:13:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:21,813 INFO L225 Difference]: With dead ends: 161 [2022-07-22 22:13:21,813 INFO L226 Difference]: Without dead ends: 116 [2022-07-22 22:13:21,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:13:21,814 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 87 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:21,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 154 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:13:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-22 22:13:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-22 22:13:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) [2022-07-22 22:13:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2022-07-22 22:13:21,823 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 62 [2022-07-22 22:13:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:21,823 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2022-07-22 22:13:21,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 22:13:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2022-07-22 22:13:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 22:13:21,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:21,825 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1] [2022-07-22 22:13:21,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 22:13:21,825 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:21,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:21,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1448791323, now seen corresponding path program 1 times [2022-07-22 22:13:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:21,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853471589] [2022-07-22 22:13:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:21,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:21,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:21,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:21,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:22,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 22:13:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:22,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:13:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 22:13:22,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:22,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853471589] [2022-07-22 22:13:22,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853471589] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:13:22,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126358890] [2022-07-22 22:13:22,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:22,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:13:22,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:13:22,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:13:22,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 22:13:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:22,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 2505 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 22:13:22,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:13:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-22 22:13:22,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:13:22,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126358890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:22,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:13:22,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-07-22 22:13:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241157607] [2022-07-22 22:13:22,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:22,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:13:22,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:13:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:13:22,544 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-22 22:13:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:22,655 INFO L93 Difference]: Finished difference Result 204 states and 232 transitions. [2022-07-22 22:13:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:13:22,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 66 [2022-07-22 22:13:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:22,657 INFO L225 Difference]: With dead ends: 204 [2022-07-22 22:13:22,657 INFO L226 Difference]: Without dead ends: 116 [2022-07-22 22:13:22,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:13:22,658 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 32 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:22,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 253 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2022-07-22 22:13:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-22 22:13:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-22 22:13:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.069767441860465) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) [2022-07-22 22:13:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2022-07-22 22:13:22,665 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 66 [2022-07-22 22:13:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:22,666 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2022-07-22 22:13:22,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-22 22:13:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2022-07-22 22:13:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 22:13:22,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:22,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1] [2022-07-22 22:13:22,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 22:13:22,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:13:22,894 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:22,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:22,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2108322845, now seen corresponding path program 1 times [2022-07-22 22:13:22,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:22,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91357122] [2022-07-22 22:13:22,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:22,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:22,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:23,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:23,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:23,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:23,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 22:13:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:23,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:13:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 22:13:23,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:23,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91357122] [2022-07-22 22:13:23,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91357122] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:13:23,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496729118] [2022-07-22 22:13:23,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:23,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:13:23,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:13:23,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:13:23,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 22:13:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:23,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 2500 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 22:13:23,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:13:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 22:13:23,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:13:23,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496729118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:23,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:13:23,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 22:13:23,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135956365] [2022-07-22 22:13:23,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:23,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:13:23,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:23,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:13:23,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:13:23,490 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-22 22:13:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:23,511 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2022-07-22 22:13:23,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:13:23,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 66 [2022-07-22 22:13:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:23,512 INFO L225 Difference]: With dead ends: 195 [2022-07-22 22:13:23,512 INFO L226 Difference]: Without dead ends: 102 [2022-07-22 22:13:23,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:13:23,513 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 7 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:23,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 221 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:13:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-22 22:13:23,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-22 22:13:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 76 states have internal predecessors, (77), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (21), 16 states have call predecessors, (21), 17 states have call successors, (21) [2022-07-22 22:13:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2022-07-22 22:13:23,520 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 66 [2022-07-22 22:13:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:23,520 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2022-07-22 22:13:23,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-22 22:13:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2022-07-22 22:13:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 22:13:23,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:23,521 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:23,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 22:13:23,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:13:23,747 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:23,748 INFO L85 PathProgramCache]: Analyzing trace with hash 325130519, now seen corresponding path program 1 times [2022-07-22 22:13:23,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:23,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491046572] [2022-07-22 22:13:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:24,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:24,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:24,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:24,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:24,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 22:13:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:24,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:13:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 22:13:24,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:24,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491046572] [2022-07-22 22:13:24,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491046572] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:13:24,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678542468] [2022-07-22 22:13:24,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:24,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:13:24,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:13:24,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:13:24,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 22:13:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:25,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 2497 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-22 22:13:25,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:13:25,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:13:25,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:13:25,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:13:25,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-22 22:13:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:13:25,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:13:26,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678542468] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:13:26,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:13:26,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2022-07-22 22:13:26,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091808764] [2022-07-22 22:13:26,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 22:13:26,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-22 22:13:26,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:26,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-22 22:13:26,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2022-07-22 22:13:26,200 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 29 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 25 states have internal predecessors, (94), 10 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-22 22:13:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:27,972 INFO L93 Difference]: Finished difference Result 241 states and 273 transitions. [2022-07-22 22:13:27,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-22 22:13:27,973 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 25 states have internal predecessors, (94), 10 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 66 [2022-07-22 22:13:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:27,974 INFO L225 Difference]: With dead ends: 241 [2022-07-22 22:13:27,974 INFO L226 Difference]: Without dead ends: 163 [2022-07-22 22:13:27,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=326, Invalid=2980, Unknown=0, NotChecked=0, Total=3306 [2022-07-22 22:13:27,976 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 199 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 826 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:27,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 738 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1373 Invalid, 0 Unknown, 826 Unchecked, 1.0s Time] [2022-07-22 22:13:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-22 22:13:27,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 97. [2022-07-22 22:13:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 71 states have internal predecessors, (72), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-22 22:13:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-07-22 22:13:27,989 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 66 [2022-07-22 22:13:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:27,989 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-07-22 22:13:27,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 25 states have internal predecessors, (94), 10 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-22 22:13:27,989 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-07-22 22:13:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-22 22:13:27,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:27,990 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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, 1, 1] [2022-07-22 22:13:28,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 22:13:28,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-22 22:13:28,216 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:28,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:28,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1497368934, now seen corresponding path program 1 times [2022-07-22 22:13:28,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:28,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414568374] [2022-07-22 22:13:28,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:28,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:28,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:28,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:28,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:28,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:28,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:13:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:28,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:13:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:28,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:13:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:28,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 22:13:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 22:13:28,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:28,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414568374] [2022-07-22 22:13:28,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414568374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:28,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:28,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:13:28,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915608352] [2022-07-22 22:13:28,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:28,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:13:28,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:28,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:13:28,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:13:28,535 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-22 22:13:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:28,992 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-07-22 22:13:28,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:13:28,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 68 [2022-07-22 22:13:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:28,994 INFO L225 Difference]: With dead ends: 103 [2022-07-22 22:13:28,994 INFO L226 Difference]: Without dead ends: 101 [2022-07-22 22:13:28,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 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-22 22:13:28,996 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 59 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:28,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 154 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:13:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-22 22:13:29,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-22 22:13:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 74 states have internal predecessors, (75), 17 states have call successors, (17), 11 states have call predecessors, (17), 11 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-22 22:13:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-07-22 22:13:29,010 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 68 [2022-07-22 22:13:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:29,011 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-07-22 22:13:29,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-22 22:13:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-07-22 22:13:29,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 22:13:29,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:29,012 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1] [2022-07-22 22:13:29,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-22 22:13:29,013 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:29,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:29,014 INFO L85 PathProgramCache]: Analyzing trace with hash 997273396, now seen corresponding path program 1 times [2022-07-22 22:13:29,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:29,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932280718] [2022-07-22 22:13:29,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:29,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:13:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:13:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:13:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 22:13:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:13:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-22 22:13:29,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:29,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932280718] [2022-07-22 22:13:29,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932280718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:29,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:29,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:13:29,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930192146] [2022-07-22 22:13:29,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:29,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:13:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:29,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:13:29,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:13:29,281 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-22 22:13:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:29,615 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2022-07-22 22:13:29,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:13:29,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2022-07-22 22:13:29,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:29,617 INFO L225 Difference]: With dead ends: 107 [2022-07-22 22:13:29,617 INFO L226 Difference]: Without dead ends: 105 [2022-07-22 22:13:29,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:13:29,617 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 48 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:29,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 182 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:13:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-22 22:13:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-22 22:13:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.04) internal successors, (78), 77 states have internal predecessors, (78), 17 states have call successors, (17), 12 states have call predecessors, (17), 12 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-22 22:13:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2022-07-22 22:13:29,627 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 74 [2022-07-22 22:13:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:29,628 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2022-07-22 22:13:29,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-22 22:13:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2022-07-22 22:13:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-22 22:13:29,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:29,629 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:29,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-22 22:13:29,629 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:29,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:29,629 INFO L85 PathProgramCache]: Analyzing trace with hash 880347013, now seen corresponding path program 1 times [2022-07-22 22:13:29,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:29,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766520683] [2022-07-22 22:13:29,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:29,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:13:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:13:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:13:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 22:13:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:13:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:13:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-22 22:13:29,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:29,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766520683] [2022-07-22 22:13:29,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766520683] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:29,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:29,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:13:29,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056249799] [2022-07-22 22:13:29,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:29,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:13:29,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:29,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:13:29,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:13:29,875 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 22:13:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:30,235 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-07-22 22:13:30,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:13:30,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2022-07-22 22:13:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:30,236 INFO L225 Difference]: With dead ends: 138 [2022-07-22 22:13:30,236 INFO L226 Difference]: Without dead ends: 84 [2022-07-22 22:13:30,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:13:30,237 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:30,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 197 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:13:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-22 22:13:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-22 22:13:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 60 states have internal predecessors, (60), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-22 22:13:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2022-07-22 22:13:30,249 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 81 [2022-07-22 22:13:30,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:30,249 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2022-07-22 22:13:30,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 22:13:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2022-07-22 22:13:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-22 22:13:30,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:30,252 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:30,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-22 22:13:30,253 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:30,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:30,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1004637351, now seen corresponding path program 1 times [2022-07-22 22:13:30,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:30,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161312364] [2022-07-22 22:13:30,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:30,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:30,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:30,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 22:13:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:30,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:13:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:30,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:13:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:30,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:13:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:30,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:13:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:13:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-22 22:13:30,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:30,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161312364] [2022-07-22 22:13:30,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161312364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:30,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:30,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-22 22:13:30,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967345214] [2022-07-22 22:13:30,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:30,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 22:13:30,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:30,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 22:13:30,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:13:30,707 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-22 22:13:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:31,263 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2022-07-22 22:13:31,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 22:13:31,264 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 93 [2022-07-22 22:13:31,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:31,264 INFO L225 Difference]: With dead ends: 90 [2022-07-22 22:13:31,264 INFO L226 Difference]: Without dead ends: 86 [2022-07-22 22:13:31,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-07-22 22:13:31,265 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 58 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:31,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 193 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:13:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-22 22:13:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-22 22:13:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.0) internal successors, (61), 61 states have internal predecessors, (61), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-22 22:13:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2022-07-22 22:13:31,275 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 93 [2022-07-22 22:13:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:31,277 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2022-07-22 22:13:31,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-22 22:13:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2022-07-22 22:13:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-22 22:13:31,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:31,278 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:31,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-22 22:13:31,279 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:31,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash 131876282, now seen corresponding path program 1 times [2022-07-22 22:13:31,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:31,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631455390] [2022-07-22 22:13:31,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:31,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:31,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:31,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 22:13:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:32,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:13:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:13:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:13:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:32,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:13:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:32,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:13:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:32,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-22 22:13:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-22 22:13:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:32,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 22:13:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:32,091 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-22 22:13:32,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:32,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631455390] [2022-07-22 22:13:32,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631455390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:32,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:32,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 22:13:32,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253976905] [2022-07-22 22:13:32,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:32,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:13:32,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:32,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:13:32,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:13:32,094 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-22 22:13:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:32,696 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-07-22 22:13:32,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 22:13:32,696 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 110 [2022-07-22 22:13:32,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:32,697 INFO L225 Difference]: With dead ends: 86 [2022-07-22 22:13:32,697 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 22:13:32,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-07-22 22:13:32,698 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 54 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:32,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 200 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:13:32,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 22:13:32,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 22:13:32,699 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-22 22:13:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 22:13:32,699 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2022-07-22 22:13:32,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:32,699 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 22:13:32,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-22 22:13:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 22:13:32,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 22:13:32,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 22:13:32,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-22 22:13:32,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 22:13:35,205 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-22 22:13:35,205 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-22 22:13:35,205 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-22 22:13:35,205 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-22 22:13:35,205 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-22 22:13:35,206 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7375 7381) the Hoare annotation is: true [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2022-07-22 22:13:35,206 INFO L899 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2022-07-22 22:13:35,207 INFO L899 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2022-07-22 22:13:35,207 INFO L899 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2022-07-22 22:13:35,207 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:13:35,207 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-22 22:13:35,207 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-22 22:13:35,207 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:13:35,207 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-22 22:13:35,207 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-22 22:13:35,207 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-22 22:13:35,207 INFO L899 garLoopResultBuilder]: For program point L8219-1(line 8219) no Hoare annotation was computed. [2022-07-22 22:13:35,207 INFO L895 garLoopResultBuilder]: At program point L8219(line 8219) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616) 36028797018963967)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) [2022-07-22 22:13:35,207 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-22 22:13:35,207 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= (select .cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= .cse3 0) (= (select .cse4 .cse1) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= 0 .cse3) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0) (= (select .cse4 .cse5) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse0 .cse5)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))) [2022-07-22 22:13:35,207 INFO L902 garLoopResultBuilder]: At program point L8963(line 8963) the Hoare annotation is: true [2022-07-22 22:13:35,208 INFO L899 garLoopResultBuilder]: For program point L8963-1(line 8963) no Hoare annotation was computed. [2022-07-22 22:13:35,208 INFO L895 garLoopResultBuilder]: At program point L8967(line 8967) the Hoare annotation is: (let ((.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse19 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse20 (select .cse22 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse17 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse2 (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|)) (.cse3 (= (select .cse17 .cse21) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= (select .cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (<= .cse20 0)) (.cse7 (select .cse19 .cse21)) (.cse8 (<= 0 .cse20)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse10 (= (select .cse19 .cse18) 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1212#1| 0)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse15 (= 0 (select .cse17 .cse18))) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse15 .cse16))))) [2022-07-22 22:13:35,208 INFO L899 garLoopResultBuilder]: For program point L8967-1(line 8967) no Hoare annotation was computed. [2022-07-22 22:13:35,208 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 22:13:35,208 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 22:13:35,208 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 22:13:35,208 INFO L899 garLoopResultBuilder]: For program point L8959(lines 8959 8975) no Hoare annotation was computed. [2022-07-22 22:13:35,208 INFO L899 garLoopResultBuilder]: For program point L8972(lines 8972 8974) no Hoare annotation was computed. [2022-07-22 22:13:35,208 INFO L899 garLoopResultBuilder]: For program point L8972-2(lines 8972 8974) no Hoare annotation was computed. [2022-07-22 22:13:35,208 INFO L902 garLoopResultBuilder]: At program point L8976(line 8976) the Hoare annotation is: true [2022-07-22 22:13:35,208 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= (select .cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= .cse3 0) (= (select .cse4 .cse1) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= 0 .cse3) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0) (= (select .cse4 .cse5) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (= |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|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse0 .cse5)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))) [2022-07-22 22:13:35,208 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= (select .cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= .cse3 0) (= (select .cse4 .cse1) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= 0 .cse3) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0) (= (select .cse4 .cse5) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse0 .cse5)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))) [2022-07-22 22:13:35,208 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse19 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse20 (select .cse22 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse17 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse2 (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|)) (.cse3 (= (select .cse17 .cse21) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= (select .cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (<= .cse20 0)) (.cse7 (select .cse19 .cse21)) (.cse8 (<= 0 .cse20)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse10 (= (select .cse19 .cse18) 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1213#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse15 (= 0 (select .cse17 .cse18))) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse14 .cse15 .cse16))))) [2022-07-22 22:13:35,209 INFO L899 garLoopResultBuilder]: For program point L8968-1(line 8968) no Hoare annotation was computed. [2022-07-22 22:13:35,209 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-22 22:13:35,209 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 22:13:35,209 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-22 22:13:35,209 INFO L895 garLoopResultBuilder]: At program point L8230(line 8230) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse13 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8)) (.cse15 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse14 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0))) (.cse1 (= 0 (select .cse15 .cse14))) (.cse2 (select .cse15 .cse12)) (.cse3 (= (select .cse13 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0)) (.cse4 (= (select .cse11 .cse14) 0)) (.cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= (select .cse13 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse8 (= (select .cse11 .cse12) 0)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 (= .cse2 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616) 36028797018963967)) .cse9 .cse10) (and .cse0 .cse1 (= .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse8 .cse9 .cse10)))) [2022-07-22 22:13:35,209 INFO L895 garLoopResultBuilder]: At program point L8969(lines 8969 8971) the Hoare annotation is: (let ((.cse23 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse20 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse21 (select .cse23 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse22 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse2 (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|)) (.cse3 (= (select .cse18 .cse22) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= (select .cse23 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (<= .cse21 0)) (.cse7 (select .cse20 .cse22)) (.cse8 (<= 0 .cse21)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse10 (= (select .cse20 .cse19) 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1214#1.offset| 0)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse15 (= 0 (select .cse18 .cse19))) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1214#1.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse15 .cse16 .cse17))))) [2022-07-22 22:13:35,209 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-22 22:13:35,210 INFO L899 garLoopResultBuilder]: For program point L8969-1(lines 8969 8971) no Hoare annotation was computed. [2022-07-22 22:13:35,210 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= (select .cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= .cse3 0) (= (select .cse4 .cse1) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= 0 .cse3) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0) (= (select .cse4 .cse5) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse0 .cse5)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))) [2022-07-22 22:13:35,210 INFO L899 garLoopResultBuilder]: For program point L8230-2(line 8230) no Hoare annotation was computed. [2022-07-22 22:13:35,210 INFO L895 garLoopResultBuilder]: At program point L8230-1(line 8230) the Hoare annotation is: (let ((.cse13 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse14 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8)) (.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0))) (.cse1 (= 0 (select .cse17 .cse16))) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1059#1| 1)) (.cse2 (select .cse17 .cse14)) (.cse4 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0)) (.cse5 (= (select .cse13 .cse16) 0)) (.cse6 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1059#1|)) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse9 (= (select .cse15 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse10 (= (select .cse13 .cse14) 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 (= .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 (= .cse2 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616) 36028797018963967)) .cse11 .cse12)))) [2022-07-22 22:13:35,210 INFO L899 garLoopResultBuilder]: For program point L8222(lines 8222 8223) no Hoare annotation was computed. [2022-07-22 22:13:35,210 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-22 22:13:35,211 INFO L899 garLoopResultBuilder]: For program point L8222-2(lines 8222 8223) no Hoare annotation was computed. [2022-07-22 22:13:35,211 INFO L895 garLoopResultBuilder]: At program point L8966-1(line 8966) the Hoare annotation is: (let ((.cse17 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse18 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse16 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse20 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse20 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1211#1| 1)) (.cse3 (= (select .cse16 .cse19) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1211#1|)) (.cse6 (= (select .cse20 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse8 (select .cse18 .cse19)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse10 (= (select .cse18 .cse17) 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (= 0 (select .cse16 .cse17))) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse7 (= .cse8 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= .cse8 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))))) [2022-07-22 22:13:35,211 INFO L895 garLoopResultBuilder]: At program point L8231(lines 8218 8232) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (let ((.cse10 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse11 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse11) (not (= (mod .cse11 18446744073709551616) 0))))))) (or (and .cse7 .cse8 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) 18446744073709551616)))) .cse9 .cse10) (and .cse7 .cse2 .cse8 .cse9 .cse6 .cse10))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse8 .cse3 .cse4 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616) 36028797018963967)) .cse9 .cse6) (and .cse0 .cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0))))) [2022-07-22 22:13:35,211 INFO L899 garLoopResultBuilder]: For program point L8966-2(line 8966) no Hoare annotation was computed. [2022-07-22 22:13:35,211 INFO L895 garLoopResultBuilder]: At program point L8966(line 8966) the Hoare annotation is: (let ((.cse19 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse14 (select .cse19 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|))) (.cse15 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse19 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= (select .cse15 .cse18) 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse4 (= .cse14 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse6 (select .cse17 .cse18)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse8 (= (select .cse17 .cse16) 0)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse12 (= 0 (select .cse15 .cse16))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and .cse0 .cse1 (<= .cse14 (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) .cse14) 18446744073709551616)))) .cse2 .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5 (= .cse6 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse12 .cse13))))) [2022-07-22 22:13:35,212 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-22 22:13:35,212 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-22 22:13:35,212 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-22 22:13:35,212 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:13:35,212 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:13:35,212 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-22 22:13:35,215 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:35,217 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 22:13:35,227 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,228 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,228 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,228 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,228 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,229 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,229 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,229 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,229 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,229 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,230 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,230 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,230 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,230 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,230 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,231 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,231 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,231 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,231 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,232 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,232 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,232 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,232 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,232 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,237 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,238 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,238 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,238 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,238 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,238 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,239 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,239 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,239 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,239 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,239 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,240 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,240 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,240 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,240 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,240 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,241 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,241 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,241 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,241 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,241 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,242 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,242 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,242 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 10:13:35 BoogieIcfgContainer [2022-07-22 22:13:35,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 22:13:35,245 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 22:13:35,245 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 22:13:35,245 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 22:13:35,246 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:13:05" (3/4) ... [2022-07-22 22:13:35,248 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 22:13:35,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-22 22:13:35,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-22 22:13:35,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-07-22 22:13:35,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-22 22:13:35,255 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-22 22:13:35,266 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2022-07-22 22:13:35,267 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2022-07-22 22:13:35,268 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-07-22 22:13:35,269 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-22 22:13:35,270 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-22 22:13:35,270 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-22 22:13:35,271 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 22:13:35,272 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 22:13:35,298 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (((((unknown-#res!len-unknown == 0 && !(buf == 0)) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && buf == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))) || (((((unknown-#res!len-unknown == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && !(buf == 0)) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))))) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && unknown-#res!len-unknown == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && capacity <= capacity / 18446744073709551616 * 18446744073709551616 + 36028797018963967) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0)) || (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && array == 0) && bytes == array) && aws_byte_buf_from_empty_array_#res#1.buffer == array) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (((((unknown-#res!len-unknown == 0 && !(buf == 0)) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && buf == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))) || (((((unknown-#res!len-unknown == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && !(buf == 0)) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))))) && bytes == 0) [2022-07-22 22:13:35,644 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 22:13:35,644 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 22:13:35,645 INFO L158 Benchmark]: Toolchain (without parser) took 33715.93ms. Allocated memory was 100.7MB in the beginning and 369.1MB in the end (delta: 268.4MB). Free memory was 64.8MB in the beginning and 77.0MB in the end (delta: -12.1MB). Peak memory consumption was 254.5MB. Max. memory is 16.1GB. [2022-07-22 22:13:35,645 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 81.8MB. Free memory is still 44.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 22:13:35,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2150.53ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 64.8MB in the beginning and 77.2MB in the end (delta: -12.4MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2022-07-22 22:13:35,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 175.55ms. Allocated memory is still 127.9MB. Free memory was 77.2MB in the beginning and 65.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 22:13:35,646 INFO L158 Benchmark]: Boogie Preprocessor took 76.41ms. Allocated memory is still 127.9MB. Free memory was 65.2MB in the beginning and 59.0MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 22:13:35,646 INFO L158 Benchmark]: RCFGBuilder took 1291.31ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 59.0MB in the beginning and 81.6MB in the end (delta: -22.6MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2022-07-22 22:13:35,647 INFO L158 Benchmark]: TraceAbstraction took 29616.32ms. Allocated memory was 161.5MB in the beginning and 369.1MB in the end (delta: 207.6MB). Free memory was 81.6MB in the beginning and 205.9MB in the end (delta: -124.3MB). Peak memory consumption was 196.5MB. Max. memory is 16.1GB. [2022-07-22 22:13:35,647 INFO L158 Benchmark]: Witness Printer took 399.02ms. Allocated memory is still 369.1MB. Free memory was 205.9MB in the beginning and 77.0MB in the end (delta: 129.0MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. [2022-07-22 22:13:35,648 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.22ms. Allocated memory is still 81.8MB. Free memory is still 44.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2150.53ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 64.8MB in the beginning and 77.2MB in the end (delta: -12.4MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 175.55ms. Allocated memory is still 127.9MB. Free memory was 77.2MB in the beginning and 65.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.41ms. Allocated memory is still 127.9MB. Free memory was 65.2MB in the beginning and 59.0MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1291.31ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 59.0MB in the beginning and 81.6MB in the end (delta: -22.6MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * TraceAbstraction took 29616.32ms. Allocated memory was 161.5MB in the beginning and 369.1MB in the end (delta: 207.6MB). Free memory was 81.6MB in the beginning and 205.9MB in the end (delta: -124.3MB). Peak memory consumption was 196.5MB. Max. memory is 16.1GB. * Witness Printer took 399.02ms. Allocated memory is still 369.1MB. Free memory was 205.9MB in the beginning and 77.0MB in the end (delta: 129.0MB). Peak memory consumption was 127.9MB. 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_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,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, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.5s, OverallIterations: 29, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2133 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2063 mSDsluCounter, 6912 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 890 IncrementalHoareTripleChecker+Unchecked, 4717 mSDsCounter, 676 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9948 IncrementalHoareTripleChecker+Invalid, 11514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 676 mSolverCounterUnsat, 2195 mSDtfsCounter, 9948 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1074 GetRequests, 677 SyntacticMatches, 6 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=17, InterpolantAutomatonStates: 292, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 275 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 220 PreInvPairs, 245 NumberOfFragments, 2084 HoareAnnotationTreeSize, 220 FomulaSimplifications, 978 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 21 FomulaSimplificationsInter, 8244 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1909 NumberOfCodeBlocks, 1909 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1875 ConstructedInterpolants, 37 QuantifiedInterpolants, 7921 SizeOfPredicates, 29 NumberOfNonLiveVariables, 12376 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 34 InterpolantComputations, 28 PerfectInterpolantSequences, 612/653 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: 8976]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8218]: Loop Invariant [2022-07-22 22:13:35,659 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,660 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,660 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,660 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,660 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,660 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,660 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,660 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,661 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,661 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,661 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,661 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,661 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,661 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,661 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,661 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,662 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,662 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,662 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,662 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,662 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,662 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,662 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,662 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,664 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,664 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,664 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,664 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,665 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,665 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,665 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,665 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,665 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,665 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,665 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,665 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,666 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,666 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,666 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,666 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,666 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,666 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,666 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,666 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,667 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,667 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-07-22 22:13:35,667 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-07-22 22:13:35,667 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] Derived loop invariant: (((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (((((unknown-#res!len-unknown == 0 && !(buf == 0)) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && buf == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))) || (((((unknown-#res!len-unknown == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && !(buf == 0)) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))))) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && unknown-#res!len-unknown == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && capacity <= capacity / 18446744073709551616 * 18446744073709551616 + 36028797018963967) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0)) || (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && array == 0) && bytes == array) && aws_byte_buf_from_empty_array_#res#1.buffer == array) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (((((unknown-#res!len-unknown == 0 && !(buf == 0)) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && buf == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))) || (((((unknown-#res!len-unknown == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && !(buf == 0)) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))))) && bytes == 0) RESULT: Ultimate proved your program to be correct! [2022-07-22 22:13:35,679 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