./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_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 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 20:30:10,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 20:30:10,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 20:30:10,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 20:30:10,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 20:30:10,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 20:30:10,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 20:30:10,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 20:30:10,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 20:30:10,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 20:30:10,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 20:30:10,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 20:30:10,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 20:30:10,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 20:30:10,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 20:30:10,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 20:30:10,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 20:30:10,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 20:30:10,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 20:30:10,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 20:30:10,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 20:30:10,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 20:30:10,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 20:30:10,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 20:30:10,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 20:30:10,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 20:30:10,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 20:30:10,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 20:30:10,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 20:30:10,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 20:30:10,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 20:30:10,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 20:30:10,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 20:30:10,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 20:30:10,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 20:30:10,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 20:30:10,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 20:30:10,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 20:30:10,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 20:30:10,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 20:30:10,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 20:30:10,125 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 20:30:10,140 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 20:30:10,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 20:30:10,141 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 20:30:10,141 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 20:30:10,142 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 20:30:10,142 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 20:30:10,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 20:30:10,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 20:30:10,143 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 20:30:10,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 20:30:10,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 20:30:10,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 20:30:10,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 20:30:10,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 20:30:10,144 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 20:30:10,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 20:30:10,144 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 20:30:10,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 20:30:10,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 20:30:10,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 20:30:10,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 20:30:10,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:30:10,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 20:30:10,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 20:30:10,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 20:30:10,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 20:30:10,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 20:30:10,146 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 20:30:10,146 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 20:30:10,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 20:30:10,147 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 20:30:10,147 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 -> 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 [2021-11-16 20:30:10,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 20:30:10,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 20:30:10,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 20:30:10,410 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 20:30:10,410 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 20:30:10,411 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_init_harness.i [2021-11-16 20:30:10,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daca82418/9cb4f659715e4e468f0926bff27ca720/FLAG1973500f1 [2021-11-16 20:30:11,066 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 20:30:11,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2021-11-16 20:30:11,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daca82418/9cb4f659715e4e468f0926bff27ca720/FLAG1973500f1 [2021-11-16 20:30:11,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daca82418/9cb4f659715e4e468f0926bff27ca720 [2021-11-16 20:30:11,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 20:30:11,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 20:30:11,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 20:30:11,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 20:30:11,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 20:30:11,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:30:11" (1/1) ... [2021-11-16 20:30:11,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c0e5337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:30:11, skipping insertion in model container [2021-11-16 20:30:11,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:30:11" (1/1) ... [2021-11-16 20:30:11,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 20:30:11,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 20:30:11,720 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_init_harness.i[4491,4504] [2021-11-16 20:30:11,725 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_init_harness.i[4551,4564] [2021-11-16 20:30:11,737 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:30:11,740 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:30:12,179 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,184 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,185 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,185 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,187 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,197 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,198 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,199 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,199 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,431 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:30:12,432 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:30:12,433 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:30:12,433 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:30:12,437 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:30:12,440 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:30:12,441 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:30:12,442 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:30:12,444 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:30:12,445 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:30:12,562 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:30:12,638 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,638 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,698 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:30:12,785 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 20:30:12,802 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_init_harness.i[4491,4504] [2021-11-16 20:30:12,802 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_init_harness.i[4551,4564] [2021-11-16 20:30:12,804 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:30:12,804 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:30:12,850 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,850 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,850 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,850 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,851 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,854 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,854 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,855 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,855 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,870 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:30:12,871 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:30:12,871 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:30:12,872 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:30:12,872 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:30:12,872 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:30:12,873 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:30:12,873 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:30:12,873 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:30:12,874 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:30:12,890 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:30:12,925 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,925 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:30:12,945 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:30:13,131 INFO L208 MainTranslator]: Completed translation [2021-11-16 20:30:13,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:30:13 WrapperNode [2021-11-16 20:30:13,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 20:30:13,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 20:30:13,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 20:30:13,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 20:30:13,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:30:13" (1/1) ... [2021-11-16 20:30:13,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:30:13" (1/1) ... [2021-11-16 20:30:13,281 INFO L137 Inliner]: procedures = 692, calls = 2498, calls flagged for inlining = 54, calls inlined = 5, statements flattened = 775 [2021-11-16 20:30:13,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 20:30:13,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 20:30:13,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 20:30:13,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 20:30:13,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:30:13" (1/1) ... [2021-11-16 20:30:13,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:30:13" (1/1) ... [2021-11-16 20:30:13,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:30:13" (1/1) ... [2021-11-16 20:30:13,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:30:13" (1/1) ... [2021-11-16 20:30:13,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:30:13" (1/1) ... [2021-11-16 20:30:13,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:30:13" (1/1) ... [2021-11-16 20:30:13,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:30:13" (1/1) ... [2021-11-16 20:30:13,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 20:30:13,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 20:30:13,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 20:30:13,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 20:30:13,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:30:13" (1/1) ... [2021-11-16 20:30:13,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:30:13,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:30:13,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-16 20:30:13,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-16 20:30:13,462 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-11-16 20:30:13,463 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-11-16 20:30:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 20:30:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 20:30:13,463 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 20:30:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2021-11-16 20:30:13,464 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2021-11-16 20:30:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 20:30:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-11-16 20:30:13,465 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-11-16 20:30:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 20:30:13,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 20:30:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 20:30:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 20:30:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 20:30:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 20:30:13,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 20:30:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 20:30:13,466 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 20:30:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2021-11-16 20:30:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2021-11-16 20:30:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 20:30:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 20:30:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2021-11-16 20:30:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2021-11-16 20:30:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 20:30:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 20:30:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 20:30:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-11-16 20:30:13,468 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-11-16 20:30:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 20:30:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 20:30:13,680 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 20:30:13,681 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 20:30:14,831 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 20:30:14,838 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 20:30:14,839 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-16 20:30:14,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:30:14 BoogieIcfgContainer [2021-11-16 20:30:14,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 20:30:14,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 20:30:14,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 20:30:14,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 20:30:14,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:30:11" (1/3) ... [2021-11-16 20:30:14,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c8dd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:30:14, skipping insertion in model container [2021-11-16 20:30:14,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:30:13" (2/3) ... [2021-11-16 20:30:14,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c8dd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:30:14, skipping insertion in model container [2021-11-16 20:30:14,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:30:14" (3/3) ... [2021-11-16 20:30:14,848 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2021-11-16 20:30:14,852 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 20:30:14,853 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 20:30:14,897 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 20:30:14,906 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 20:30:14,906 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 20:30:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-11-16 20:30:14,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-16 20:30:14,925 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:14,926 INFO L514 BasicCegarLoop]: 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] [2021-11-16 20:30:14,927 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1013294361, now seen corresponding path program 1 times [2021-11-16 20:30:14,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:14,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066941205] [2021-11-16 20:30:14,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:14,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:30:15,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:15,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066941205] [2021-11-16 20:30:15,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066941205] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:15,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:15,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-16 20:30:15,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615413803] [2021-11-16 20:30:15,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:15,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-16 20:30:15,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:15,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-16 20:30:15,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 20:30:15,370 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:30:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:15,403 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2021-11-16 20:30:15,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-16 20:30:15,404 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 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 [2021-11-16 20:30:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:15,410 INFO L225 Difference]: With dead ends: 193 [2021-11-16 20:30:15,410 INFO L226 Difference]: Without dead ends: 93 [2021-11-16 20:30:15,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 20:30:15,418 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:15,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:30:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-16 20:30:15,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-11-16 20:30:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-11-16 20:30:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2021-11-16 20:30:15,467 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 31 [2021-11-16 20:30:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:15,468 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2021-11-16 20:30:15,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:30:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2021-11-16 20:30:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-16 20:30:15,471 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:15,472 INFO L514 BasicCegarLoop]: 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] [2021-11-16 20:30:15,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 20:30:15,472 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:15,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1912179751, now seen corresponding path program 1 times [2021-11-16 20:30:15,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:15,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676781319] [2021-11-16 20:30:15,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:15,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:30:15,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:15,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676781319] [2021-11-16 20:30:15,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676781319] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:15,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:15,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 20:30:15,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13058680] [2021-11-16 20:30:15,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:15,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 20:30:15,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:15,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 20:30:15,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 20:30:15,644 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:30:15,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:15,711 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2021-11-16 20:30:15,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:30:15,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-11-16 20:30:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:15,715 INFO L225 Difference]: With dead ends: 147 [2021-11-16 20:30:15,715 INFO L226 Difference]: Without dead ends: 110 [2021-11-16 20:30:15,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:30:15,717 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 9 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:15,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 340 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:30:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-16 20:30:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2021-11-16 20:30:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-11-16 20:30:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2021-11-16 20:30:15,729 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 31 [2021-11-16 20:30:15,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:15,729 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2021-11-16 20:30:15,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:30:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2021-11-16 20:30:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-16 20:30:15,756 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:15,756 INFO L514 BasicCegarLoop]: 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] [2021-11-16 20:30:15,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-16 20:30:15,757 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:15,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:15,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2124622107, now seen corresponding path program 1 times [2021-11-16 20:30:15,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:15,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740667301] [2021-11-16 20:30:15,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:15,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:30:15,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:15,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740667301] [2021-11-16 20:30:15,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740667301] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:15,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:15,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 20:30:15,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130911497] [2021-11-16 20:30:15,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:15,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:30:15,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:15,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:30:15,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:30:15,952 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:30:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:16,030 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2021-11-16 20:30:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:30:16,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-11-16 20:30:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:16,035 INFO L225 Difference]: With dead ends: 134 [2021-11-16 20:30:16,038 INFO L226 Difference]: Without dead ends: 96 [2021-11-16 20:30:16,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:30:16,042 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 46 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:16,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 464 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:30:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-16 20:30:16,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-11-16 20:30:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-11-16 20:30:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2021-11-16 20:30:16,058 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2021-11-16 20:30:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:16,060 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2021-11-16 20:30:16,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:30:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2021-11-16 20:30:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-16 20:30:16,064 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:16,064 INFO L514 BasicCegarLoop]: 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] [2021-11-16 20:30:16,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-16 20:30:16,065 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash 966724818, now seen corresponding path program 1 times [2021-11-16 20:30:16,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:16,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873046307] [2021-11-16 20:30:16,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:16,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:30:16,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:16,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873046307] [2021-11-16 20:30:16,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873046307] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:16,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:16,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 20:30:16,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510708455] [2021-11-16 20:30:16,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:16,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 20:30:16,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:16,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 20:30:16,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 20:30:16,232 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:30:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:16,261 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2021-11-16 20:30:16,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:30:16,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 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 [2021-11-16 20:30:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:16,264 INFO L225 Difference]: With dead ends: 141 [2021-11-16 20:30:16,264 INFO L226 Difference]: Without dead ends: 106 [2021-11-16 20:30:16,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:30:16,267 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 29 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:16,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 320 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:30:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-11-16 20:30:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2021-11-16 20:30:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-11-16 20:30:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2021-11-16 20:30:16,288 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 37 [2021-11-16 20:30:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:16,288 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2021-11-16 20:30:16,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:30:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2021-11-16 20:30:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-16 20:30:16,289 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:16,290 INFO L514 BasicCegarLoop]: 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] [2021-11-16 20:30:16,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-16 20:30:16,290 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:16,290 INFO L85 PathProgramCache]: Analyzing trace with hash 265660240, now seen corresponding path program 1 times [2021-11-16 20:30:16,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:16,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447029361] [2021-11-16 20:30:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:16,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:30:16,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:16,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447029361] [2021-11-16 20:30:16,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447029361] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:16,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:16,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 20:30:16,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752463597] [2021-11-16 20:30:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:16,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:30:16,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:16,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:30:16,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:30:16,570 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:30:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:16,625 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2021-11-16 20:30:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:30:16,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 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 [2021-11-16 20:30:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:16,627 INFO L225 Difference]: With dead ends: 110 [2021-11-16 20:30:16,627 INFO L226 Difference]: Without dead ends: 108 [2021-11-16 20:30:16,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:30:16,628 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 22 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:16,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 733 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:30:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-16 20:30:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2021-11-16 20:30:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 75 states have internal predecessors, (85), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2021-11-16 20:30:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2021-11-16 20:30:16,634 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 37 [2021-11-16 20:30:16,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:16,635 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2021-11-16 20:30:16,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:30:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2021-11-16 20:30:16,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-16 20:30:16,636 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:16,636 INFO L514 BasicCegarLoop]: 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] [2021-11-16 20:30:16,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-16 20:30:16,636 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:16,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:16,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1062822234, now seen corresponding path program 1 times [2021-11-16 20:30:16,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:16,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155393409] [2021-11-16 20:30:16,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:16,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:30:16,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:16,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155393409] [2021-11-16 20:30:16,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155393409] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:16,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:16,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 20:30:16,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750515380] [2021-11-16 20:30:16,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:16,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:30:16,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:16,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:30:16,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:30:16,902 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:30:18,936 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:20,505 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:22,116 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2021-11-16 20:30:22,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 20:30:22,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 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 [2021-11-16 20:30:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:22,118 INFO L225 Difference]: With dead ends: 184 [2021-11-16 20:30:22,118 INFO L226 Difference]: Without dead ends: 143 [2021-11-16 20:30:22,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:30:22,119 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 78 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:22,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 634 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2021-11-16 20:30:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-16 20:30:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2021-11-16 20:30:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.186046511627907) internal successors, (102), 89 states have internal predecessors, (102), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-11-16 20:30:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2021-11-16 20:30:22,124 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 41 [2021-11-16 20:30:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:22,124 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2021-11-16 20:30:22,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:30:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2021-11-16 20:30:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-16 20:30:22,125 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:22,125 INFO L514 BasicCegarLoop]: 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] [2021-11-16 20:30:22,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-16 20:30:22,126 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:22,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:22,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1952281384, now seen corresponding path program 1 times [2021-11-16 20:30:22,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:22,127 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595980939] [2021-11-16 20:30:22,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:22,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:22,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:22,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:22,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:22,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:30:22,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:22,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595980939] [2021-11-16 20:30:22,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595980939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:22,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:22,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 20:30:22,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644385147] [2021-11-16 20:30:22,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:22,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:30:22,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:22,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:30:22,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:30:22,353 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:30:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:23,973 INFO L93 Difference]: Finished difference Result 210 states and 261 transitions. [2021-11-16 20:30:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:30:23,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 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 [2021-11-16 20:30:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:23,974 INFO L225 Difference]: With dead ends: 210 [2021-11-16 20:30:23,975 INFO L226 Difference]: Without dead ends: 155 [2021-11-16 20:30:23,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:30:23,975 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 56 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:23,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 623 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-16 20:30:23,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-16 20:30:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2021-11-16 20:30:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 91 states have internal predecessors, (105), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-11-16 20:30:23,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2021-11-16 20:30:23,980 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 41 [2021-11-16 20:30:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:23,980 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2021-11-16 20:30:23,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:30:23,981 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2021-11-16 20:30:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-16 20:30:23,981 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:23,981 INFO L514 BasicCegarLoop]: 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] [2021-11-16 20:30:23,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-16 20:30:23,981 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:23,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1694115946, now seen corresponding path program 1 times [2021-11-16 20:30:23,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:23,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159581532] [2021-11-16 20:30:23,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:23,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:24,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:24,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:30:24,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:24,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159581532] [2021-11-16 20:30:24,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159581532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:24,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:24,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-16 20:30:24,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266730138] [2021-11-16 20:30:24,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:24,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-16 20:30:24,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:24,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-16 20:30:24,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:30:24,397 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-16 20:30:26,525 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:27,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:27,225 INFO L93 Difference]: Finished difference Result 212 states and 270 transitions. [2021-11-16 20:30:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 20:30:27,225 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2021-11-16 20:30:27,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:27,226 INFO L225 Difference]: With dead ends: 212 [2021-11-16 20:30:27,226 INFO L226 Difference]: Without dead ends: 155 [2021-11-16 20:30:27,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-11-16 20:30:27,227 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 237 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 80 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:27,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 578 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 283 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2021-11-16 20:30:27,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-16 20:30:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2021-11-16 20:30:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 100 states have (on average 1.21) internal successors, (121), 105 states have internal predecessors, (121), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2021-11-16 20:30:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2021-11-16 20:30:27,235 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 41 [2021-11-16 20:30:27,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:27,236 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2021-11-16 20:30:27,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-16 20:30:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2021-11-16 20:30:27,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-16 20:30:27,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:27,236 INFO L514 BasicCegarLoop]: 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] [2021-11-16 20:30:27,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-16 20:30:27,237 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:27,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:27,237 INFO L85 PathProgramCache]: Analyzing trace with hash -267360230, now seen corresponding path program 1 times [2021-11-16 20:30:27,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:27,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128177937] [2021-11-16 20:30:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:27,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:27,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:27,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:27,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:27,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:30:27,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:27,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128177937] [2021-11-16 20:30:27,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128177937] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:27,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:27,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 20:30:27,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607469429] [2021-11-16 20:30:27,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:27,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:30:27,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:27,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:30:27,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:30:27,402 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:30:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:27,819 INFO L93 Difference]: Finished difference Result 225 states and 287 transitions. [2021-11-16 20:30:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:30:27,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 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 [2021-11-16 20:30:27,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:27,821 INFO L225 Difference]: With dead ends: 225 [2021-11-16 20:30:27,821 INFO L226 Difference]: Without dead ends: 156 [2021-11-16 20:30:27,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:30:27,822 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 30 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:27,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 340 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-16 20:30:27,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-11-16 20:30:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 138. [2021-11-16 20:30:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.198019801980198) internal successors, (121), 106 states have internal predecessors, (121), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2021-11-16 20:30:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2021-11-16 20:30:27,829 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 41 [2021-11-16 20:30:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:27,829 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2021-11-16 20:30:27,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:30:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2021-11-16 20:30:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-16 20:30:27,831 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:27,831 INFO L514 BasicCegarLoop]: 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] [2021-11-16 20:30:27,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-16 20:30:27,831 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:27,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:27,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1627279489, now seen corresponding path program 1 times [2021-11-16 20:30:27,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:27,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646185730] [2021-11-16 20:30:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:27,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:27,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:27,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:27,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:27,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:30:28,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:28,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646185730] [2021-11-16 20:30:28,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646185730] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:28,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:28,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 20:30:28,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192927318] [2021-11-16 20:30:28,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:28,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:30:28,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:28,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:30:28,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:30:28,031 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:30:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:28,132 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2021-11-16 20:30:28,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 20:30:28,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 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 [2021-11-16 20:30:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:28,134 INFO L225 Difference]: With dead ends: 164 [2021-11-16 20:30:28,135 INFO L226 Difference]: Without dead ends: 162 [2021-11-16 20:30:28,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:30:28,135 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 26 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:28,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 934 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:30:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-16 20:30:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2021-11-16 20:30:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 114 states have internal predecessors, (128), 22 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (29), 20 states have call predecessors, (29), 21 states have call successors, (29) [2021-11-16 20:30:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2021-11-16 20:30:28,143 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 43 [2021-11-16 20:30:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:28,143 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2021-11-16 20:30:28,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:30:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2021-11-16 20:30:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-16 20:30:28,144 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:28,144 INFO L514 BasicCegarLoop]: 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] [2021-11-16 20:30:28,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-16 20:30:28,144 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1966623229, now seen corresponding path program 1 times [2021-11-16 20:30:28,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:28,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811317408] [2021-11-16 20:30:28,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:28,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:28,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:28,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:28,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:28,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:30:28,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:28,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811317408] [2021-11-16 20:30:28,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811317408] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:28,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:28,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 20:30:28,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454348392] [2021-11-16 20:30:28,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:28,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 20:30:28,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:28,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 20:30:28,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:30:28,320 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:30:29,552 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:31,488 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:32,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:32,560 INFO L93 Difference]: Finished difference Result 250 states and 311 transitions. [2021-11-16 20:30:32,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:30:32,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 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 [2021-11-16 20:30:32,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:32,562 INFO L225 Difference]: With dead ends: 250 [2021-11-16 20:30:32,562 INFO L226 Difference]: Without dead ends: 172 [2021-11-16 20:30:32,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:30:32,562 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 44 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:32,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 459 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2021-11-16 20:30:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-11-16 20:30:32,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 139. [2021-11-16 20:30:32,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 102 states have (on average 1.196078431372549) internal successors, (122), 107 states have internal predecessors, (122), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2021-11-16 20:30:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2021-11-16 20:30:32,572 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 43 [2021-11-16 20:30:32,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:32,573 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2021-11-16 20:30:32,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:30:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2021-11-16 20:30:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-16 20:30:32,575 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:32,576 INFO L514 BasicCegarLoop]: 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] [2021-11-16 20:30:32,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-16 20:30:32,576 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:32,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:32,576 INFO L85 PathProgramCache]: Analyzing trace with hash 598348136, now seen corresponding path program 1 times [2021-11-16 20:30:32,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:32,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706001416] [2021-11-16 20:30:32,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:32,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:32,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:32,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:32,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:32,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:32,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:30:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:32,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 20:30:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-16 20:30:32,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:32,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706001416] [2021-11-16 20:30:32,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706001416] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:32,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:32,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 20:30:32,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742991126] [2021-11-16 20:30:32,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:32,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:30:32,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:32,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:30:32,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:30:32,769 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 20:30:32,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:32,816 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2021-11-16 20:30:32,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:30:32,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2021-11-16 20:30:32,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:32,819 INFO L225 Difference]: With dead ends: 151 [2021-11-16 20:30:32,819 INFO L226 Difference]: Without dead ends: 149 [2021-11-16 20:30:32,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:30:32,820 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 22 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:32,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 748 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:30:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-11-16 20:30:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2021-11-16 20:30:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 114 states have internal predecessors, (128), 23 states have call successors, (23), 12 states have call predecessors, (23), 16 states have return successors, (30), 21 states have call predecessors, (30), 22 states have call successors, (30) [2021-11-16 20:30:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2021-11-16 20:30:32,827 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 57 [2021-11-16 20:30:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:32,827 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2021-11-16 20:30:32,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 20:30:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2021-11-16 20:30:32,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-16 20:30:32,828 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:32,829 INFO L514 BasicCegarLoop]: 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, 1] [2021-11-16 20:30:32,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-16 20:30:32,829 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:32,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:32,829 INFO L85 PathProgramCache]: Analyzing trace with hash 803127154, now seen corresponding path program 1 times [2021-11-16 20:30:32,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:32,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751235199] [2021-11-16 20:30:32,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:32,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:32,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:32,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:32,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:32,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:32,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:30:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:32,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 20:30:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:30:33,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:33,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751235199] [2021-11-16 20:30:33,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751235199] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:33,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:33,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 20:30:33,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092479251] [2021-11-16 20:30:33,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:33,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:30:33,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:33,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:30:33,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:30:33,031 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-16 20:30:34,493 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:35,042 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2021-11-16 20:30:35,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:30:35,043 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 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 61 [2021-11-16 20:30:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:35,044 INFO L225 Difference]: With dead ends: 191 [2021-11-16 20:30:35,044 INFO L226 Difference]: Without dead ends: 178 [2021-11-16 20:30:35,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:30:35,045 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 130 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:35,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 611 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-16 20:30:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-11-16 20:30:35,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2021-11-16 20:30:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.173913043478261) internal successors, (135), 123 states have internal predecessors, (135), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2021-11-16 20:30:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2021-11-16 20:30:35,051 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2021-11-16 20:30:35,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:35,054 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2021-11-16 20:30:35,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-16 20:30:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2021-11-16 20:30:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-16 20:30:35,056 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:35,056 INFO L514 BasicCegarLoop]: 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, 1] [2021-11-16 20:30:35,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-16 20:30:35,056 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:35,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:35,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2082990832, now seen corresponding path program 1 times [2021-11-16 20:30:35,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:35,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948317318] [2021-11-16 20:30:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:35,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:35,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:35,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:35,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:35,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:30:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:35,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 20:30:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:30:35,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:35,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948317318] [2021-11-16 20:30:35,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948317318] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:35,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:35,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 20:30:35,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230527010] [2021-11-16 20:30:35,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:35,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:30:35,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:35,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:30:35,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:30:35,286 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-16 20:30:36,714 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:38,902 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:40,098 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:40,906 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2021-11-16 20:30:40,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:30:40,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 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 61 [2021-11-16 20:30:40,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:40,908 INFO L225 Difference]: With dead ends: 204 [2021-11-16 20:30:40,908 INFO L226 Difference]: Without dead ends: 191 [2021-11-16 20:30:40,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:30:40,909 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 66 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:40,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 762 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2021-11-16 20:30:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-16 20:30:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2021-11-16 20:30:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.173913043478261) internal successors, (135), 123 states have internal predecessors, (135), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2021-11-16 20:30:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2021-11-16 20:30:40,915 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2021-11-16 20:30:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:40,915 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2021-11-16 20:30:40,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-16 20:30:40,916 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2021-11-16 20:30:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-16 20:30:40,916 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:40,916 INFO L514 BasicCegarLoop]: 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, 1] [2021-11-16 20:30:40,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-16 20:30:40,917 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1953811026, now seen corresponding path program 1 times [2021-11-16 20:30:40,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:40,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006159042] [2021-11-16 20:30:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:40,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:41,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:41,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:41,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:41,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:41,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:30:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:41,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 20:30:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-16 20:30:41,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:41,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006159042] [2021-11-16 20:30:41,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006159042] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:30:41,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129894954] [2021-11-16 20:30:41,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:41,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:30:41,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:30:41,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:30:41,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-16 20:30:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:41,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 2403 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-16 20:30:41,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:30:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:30:42,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:30:43,030 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-16 20:30:43,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2021-11-16 20:30:43,035 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-11-16 20:30:43,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2021-11-16 20:30:43,173 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-16 20:30:43,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2021-11-16 20:30:43,179 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-11-16 20:30:43,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2021-11-16 20:30:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:30:43,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129894954] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 20:30:43,251 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 20:30:43,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 31 [2021-11-16 20:30:43,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741876896] [2021-11-16 20:30:43,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 20:30:43,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-16 20:30:43,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:43,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-16 20:30:43,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2021-11-16 20:30:43,252 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2021-11-16 20:30:44,902 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:46,952 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:48,365 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:50,796 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:52,331 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:55,167 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:56,735 INFO L93 Difference]: Finished difference Result 288 states and 345 transitions. [2021-11-16 20:30:56,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-16 20:30:56,736 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 61 [2021-11-16 20:30:56,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:56,737 INFO L225 Difference]: With dead ends: 288 [2021-11-16 20:30:56,737 INFO L226 Difference]: Without dead ends: 234 [2021-11-16 20:30:56,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=313, Invalid=1849, Unknown=0, NotChecked=0, Total=2162 [2021-11-16 20:30:56,739 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 382 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 88 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:56,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 1795 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 767 Invalid, 2 Unknown, 174 Unchecked, 12.9s Time] [2021-11-16 20:30:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-11-16 20:30:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 207. [2021-11-16 20:30:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 153 states have (on average 1.1568627450980393) internal successors, (177), 162 states have internal predecessors, (177), 31 states have call successors, (31), 16 states have call predecessors, (31), 22 states have return successors, (43), 28 states have call predecessors, (43), 29 states have call successors, (43) [2021-11-16 20:30:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 251 transitions. [2021-11-16 20:30:56,751 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 251 transitions. Word has length 61 [2021-11-16 20:30:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:56,751 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 251 transitions. [2021-11-16 20:30:56,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2021-11-16 20:30:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2021-11-16 20:30:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-16 20:30:56,752 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:56,752 INFO L514 BasicCegarLoop]: 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, 1] [2021-11-16 20:30:56,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-16 20:30:56,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-16 20:30:56,953 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:56,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:56,953 INFO L85 PathProgramCache]: Analyzing trace with hash 151989603, now seen corresponding path program 1 times [2021-11-16 20:30:56,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:56,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627127687] [2021-11-16 20:30:56,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:56,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:57,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:57,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:57,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:57,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:57,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:30:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:57,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 20:30:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:57,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:30:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-16 20:30:57,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:57,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627127687] [2021-11-16 20:30:57,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627127687] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:57,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:57,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 20:30:57,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580854850] [2021-11-16 20:30:57,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:57,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:30:57,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:57,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:30:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:30:57,337 INFO L87 Difference]: Start difference. First operand 207 states and 251 transitions. Second operand has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:30:59,384 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:30:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:59,601 INFO L93 Difference]: Finished difference Result 225 states and 272 transitions. [2021-11-16 20:30:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:30:59,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2021-11-16 20:30:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:59,603 INFO L225 Difference]: With dead ends: 225 [2021-11-16 20:30:59,603 INFO L226 Difference]: Without dead ends: 223 [2021-11-16 20:30:59,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:30:59,604 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 39 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:59,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 596 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 102 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-11-16 20:30:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-11-16 20:30:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2021-11-16 20:30:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 160 states have (on average 1.15) internal successors, (184), 169 states have internal predecessors, (184), 34 states have call successors, (34), 18 states have call predecessors, (34), 24 states have return successors, (46), 31 states have call predecessors, (46), 32 states have call successors, (46) [2021-11-16 20:30:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2021-11-16 20:30:59,617 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 63 [2021-11-16 20:30:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:59,617 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2021-11-16 20:30:59,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:30:59,617 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2021-11-16 20:30:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-16 20:30:59,618 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:59,618 INFO L514 BasicCegarLoop]: 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, 1] [2021-11-16 20:30:59,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-16 20:30:59,619 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:59,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:59,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1802659993, now seen corresponding path program 1 times [2021-11-16 20:30:59,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:59,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033085158] [2021-11-16 20:30:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:59,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:59,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:30:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:59,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:30:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:59,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:30:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:59,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:30:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:59,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:30:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:59,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 20:30:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:30:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-16 20:30:59,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:30:59,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033085158] [2021-11-16 20:30:59,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033085158] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:30:59,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:30:59,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 20:30:59,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608482119] [2021-11-16 20:30:59,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:30:59,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:30:59,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:59,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:30:59,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:30:59,788 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 20:30:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:30:59,880 INFO L93 Difference]: Finished difference Result 247 states and 294 transitions. [2021-11-16 20:30:59,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 20:30:59,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 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 63 [2021-11-16 20:30:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:30:59,881 INFO L225 Difference]: With dead ends: 247 [2021-11-16 20:30:59,881 INFO L226 Difference]: Without dead ends: 245 [2021-11-16 20:30:59,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:30:59,883 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 26 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:30:59,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 955 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:30:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-11-16 20:30:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2021-11-16 20:30:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 167 states have (on average 1.1437125748502994) internal successors, (191), 177 states have internal predecessors, (191), 34 states have call successors, (34), 18 states have call predecessors, (34), 25 states have return successors, (47), 31 states have call predecessors, (47), 32 states have call successors, (47) [2021-11-16 20:30:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2021-11-16 20:30:59,896 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 63 [2021-11-16 20:30:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:30:59,896 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2021-11-16 20:30:59,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 20:30:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2021-11-16 20:30:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-16 20:30:59,897 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:30:59,897 INFO L514 BasicCegarLoop]: 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, 1] [2021-11-16 20:30:59,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-16 20:30:59,898 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:30:59,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:30:59,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1791242725, now seen corresponding path program 1 times [2021-11-16 20:30:59,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:30:59,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043712573] [2021-11-16 20:30:59,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:30:59,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:30:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:00,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:31:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:00,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:31:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:00,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:31:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:00,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:31:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:00,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:31:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:00,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 20:31:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:31:00,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:31:00,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043712573] [2021-11-16 20:31:00,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043712573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:31:00,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:31:00,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 20:31:00,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785678300] [2021-11-16 20:31:00,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:31:00,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:31:00,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:31:00,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:31:00,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:31:00,122 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-16 20:31:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:31:01,899 INFO L93 Difference]: Finished difference Result 269 states and 317 transitions. [2021-11-16 20:31:01,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 20:31:01,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 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 63 [2021-11-16 20:31:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:31:01,901 INFO L225 Difference]: With dead ends: 269 [2021-11-16 20:31:01,901 INFO L226 Difference]: Without dead ends: 231 [2021-11-16 20:31:01,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:31:01,902 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 51 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-16 20:31:01,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 612 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-16 20:31:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-11-16 20:31:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2021-11-16 20:31:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 157 states have (on average 1.1464968152866242) internal successors, (180), 165 states have internal predecessors, (180), 33 states have call successors, (33), 18 states have call predecessors, (33), 23 states have return successors, (43), 30 states have call predecessors, (43), 31 states have call successors, (43) [2021-11-16 20:31:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2021-11-16 20:31:01,915 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 63 [2021-11-16 20:31:01,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:31:01,915 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2021-11-16 20:31:01,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-16 20:31:01,916 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2021-11-16 20:31:01,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-16 20:31:01,917 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:31:01,917 INFO L514 BasicCegarLoop]: 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, 1] [2021-11-16 20:31:01,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-16 20:31:01,917 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:31:01,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:31:01,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1204360676, now seen corresponding path program 1 times [2021-11-16 20:31:01,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:31:01,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477770133] [2021-11-16 20:31:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:31:01,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:31:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:02,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:31:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:02,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:31:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:02,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:31:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:02,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:31:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:02,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:31:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:02,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 20:31:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:02,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:31:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:02,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:31:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-16 20:31:02,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:31:02,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477770133] [2021-11-16 20:31:02,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477770133] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:31:02,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:31:02,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 20:31:02,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010122502] [2021-11-16 20:31:02,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:31:02,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:31:02,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:31:02,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:31:02,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:31:02,090 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-16 20:31:03,826 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:31:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:31:04,150 INFO L93 Difference]: Finished difference Result 228 states and 270 transitions. [2021-11-16 20:31:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 20:31:04,151 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2021-11-16 20:31:04,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:31:04,152 INFO L225 Difference]: With dead ends: 228 [2021-11-16 20:31:04,152 INFO L226 Difference]: Without dead ends: 224 [2021-11-16 20:31:04,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:31:04,152 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 20 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:31:04,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 687 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-16 20:31:04,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-16 20:31:04,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2021-11-16 20:31:04,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 163 states have (on average 1.1349693251533743) internal successors, (185), 170 states have internal predecessors, (185), 34 states have call successors, (34), 20 states have call predecessors, (34), 24 states have return successors, (44), 31 states have call predecessors, (44), 32 states have call successors, (44) [2021-11-16 20:31:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 263 transitions. [2021-11-16 20:31:04,169 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 263 transitions. Word has length 69 [2021-11-16 20:31:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:31:04,169 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 263 transitions. [2021-11-16 20:31:04,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-16 20:31:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2021-11-16 20:31:04,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-16 20:31:04,170 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:31:04,171 INFO L514 BasicCegarLoop]: 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, 1] [2021-11-16 20:31:04,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-16 20:31:04,171 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:31:04,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:31:04,172 INFO L85 PathProgramCache]: Analyzing trace with hash 348625887, now seen corresponding path program 1 times [2021-11-16 20:31:04,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:31:04,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693169439] [2021-11-16 20:31:04,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:31:04,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:31:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:04,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:31:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:04,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:31:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:04,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:31:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:04,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:31:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:04,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-16 20:31:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:04,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-16 20:31:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:31:04,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:31:04,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693169439] [2021-11-16 20:31:04,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693169439] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:31:04,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:31:04,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-16 20:31:04,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778747717] [2021-11-16 20:31:04,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:31:04,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 20:31:04,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:31:04,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 20:31:04,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:31:04,712 INFO L87 Difference]: Start difference. First operand 222 states and 263 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-16 20:31:06,835 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:31:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:31:08,040 INFO L93 Difference]: Finished difference Result 280 states and 334 transitions. [2021-11-16 20:31:08,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:31:08,052 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 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 67 [2021-11-16 20:31:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:31:08,053 INFO L225 Difference]: With dead ends: 280 [2021-11-16 20:31:08,053 INFO L226 Difference]: Without dead ends: 254 [2021-11-16 20:31:08,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-11-16 20:31:08,055 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 222 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 70 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:31:08,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 579 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 314 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2021-11-16 20:31:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-11-16 20:31:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 227. [2021-11-16 20:31:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 166 states have (on average 1.1325301204819278) internal successors, (188), 173 states have internal predecessors, (188), 36 states have call successors, (36), 20 states have call predecessors, (36), 24 states have return successors, (47), 33 states have call predecessors, (47), 34 states have call successors, (47) [2021-11-16 20:31:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 271 transitions. [2021-11-16 20:31:08,079 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 271 transitions. Word has length 67 [2021-11-16 20:31:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:31:08,079 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 271 transitions. [2021-11-16 20:31:08,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-16 20:31:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 271 transitions. [2021-11-16 20:31:08,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-16 20:31:08,080 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:31:08,081 INFO L514 BasicCegarLoop]: 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, 1] [2021-11-16 20:31:08,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-16 20:31:08,081 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:31:08,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:31:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2139701523, now seen corresponding path program 1 times [2021-11-16 20:31:08,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:31:08,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077287352] [2021-11-16 20:31:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:31:08,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:31:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:08,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:31:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:08,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:31:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:08,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:31:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:31:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:31:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:08,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 20:31:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:08,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:31:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:08,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:31:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:31:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-16 20:31:08,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:31:08,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077287352] [2021-11-16 20:31:08,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077287352] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:31:08,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:31:08,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 20:31:08,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008977478] [2021-11-16 20:31:08,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:31:08,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 20:31:08,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:31:08,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 20:31:08,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:31:08,564 INFO L87 Difference]: Start difference. First operand 227 states and 271 transitions. Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-16 20:31:09,846 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:31:11,567 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:31:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:31:11,920 INFO L93 Difference]: Finished difference Result 235 states and 278 transitions. [2021-11-16 20:31:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:31:11,920 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2021-11-16 20:31:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:31:11,921 INFO L225 Difference]: With dead ends: 235 [2021-11-16 20:31:11,921 INFO L226 Difference]: Without dead ends: 154 [2021-11-16 20:31:11,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-11-16 20:31:11,922 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 158 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:31:11,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 674 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-11-16 20:31:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-11-16 20:31:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2021-11-16 20:31:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 100 states have (on average 1.17) internal successors, (117), 105 states have internal predecessors, (117), 24 states have call successors, (24), 12 states have call predecessors, (24), 15 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2021-11-16 20:31:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2021-11-16 20:31:11,930 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 75 [2021-11-16 20:31:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:31:11,930 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2021-11-16 20:31:11,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-16 20:31:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2021-11-16 20:31:11,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-16 20:31:11,932 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:31:11,932 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:31:11,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-16 20:31:11,932 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:31:11,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:31:11,933 INFO L85 PathProgramCache]: Analyzing trace with hash 35307555, now seen corresponding path program 1 times [2021-11-16 20:31:11,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:31:11,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365088025] [2021-11-16 20:31:11,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:31:11,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:31:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:31:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:11,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:31:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:12,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:31:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:12,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 20:31:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:12,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:12,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 20:31:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:12,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:31:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:12,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:31:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:12,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:12,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:31:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-16 20:31:12,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:31:12,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365088025] [2021-11-16 20:31:12,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365088025] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:31:12,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:31:12,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 20:31:12,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744087930] [2021-11-16 20:31:12,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:31:12,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:31:12,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:31:12,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:31:12,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:31:12,147 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 20:31:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:31:13,308 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2021-11-16 20:31:13,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:31:13,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2021-11-16 20:31:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:31:13,309 INFO L225 Difference]: With dead ends: 243 [2021-11-16 20:31:13,309 INFO L226 Difference]: Without dead ends: 153 [2021-11-16 20:31:13,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:31:13,310 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:31:13,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 362 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-16 20:31:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-16 20:31:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2021-11-16 20:31:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 109 states have internal predecessors, (121), 24 states have call successors, (24), 12 states have call predecessors, (24), 16 states have return successors, (27), 23 states have call predecessors, (27), 22 states have call successors, (27) [2021-11-16 20:31:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2021-11-16 20:31:13,315 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 79 [2021-11-16 20:31:13,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:31:13,315 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2021-11-16 20:31:13,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 20:31:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2021-11-16 20:31:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-16 20:31:13,316 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:31:13,316 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:31:13,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-16 20:31:13,317 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:31:13,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:31:13,317 INFO L85 PathProgramCache]: Analyzing trace with hash -277501736, now seen corresponding path program 1 times [2021-11-16 20:31:13,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:31:13,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261273408] [2021-11-16 20:31:13,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:31:13,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:31:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:13,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:31:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:13,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:31:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:13,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:31:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:13,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 20:31:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:13,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:13,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:13,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 20:31:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:13,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:31:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:13,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:31:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:13,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:13,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:31:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:13,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:31:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-16 20:31:13,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:31:13,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261273408] [2021-11-16 20:31:13,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261273408] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:31:13,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:31:13,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 20:31:13,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19050857] [2021-11-16 20:31:13,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:31:13,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 20:31:13,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:31:13,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 20:31:13,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:31:13,523 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-16 20:31:15,548 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:31:17,144 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:31:19,890 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:31:20,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:31:20,357 INFO L93 Difference]: Finished difference Result 244 states and 298 transitions. [2021-11-16 20:31:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-16 20:31:20,358 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2021-11-16 20:31:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:31:20,359 INFO L225 Difference]: With dead ends: 244 [2021-11-16 20:31:20,359 INFO L226 Difference]: Without dead ends: 177 [2021-11-16 20:31:20,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-11-16 20:31:20,359 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 75 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 36 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2021-11-16 20:31:20,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 462 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 518 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2021-11-16 20:31:20,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-16 20:31:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2021-11-16 20:31:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 115 states have internal predecessors, (128), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2021-11-16 20:31:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. [2021-11-16 20:31:20,371 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 180 transitions. Word has length 85 [2021-11-16 20:31:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:31:20,371 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 180 transitions. [2021-11-16 20:31:20,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-16 20:31:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2021-11-16 20:31:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-16 20:31:20,372 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:31:20,372 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:31:20,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-16 20:31:20,373 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:31:20,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:31:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash -58647018, now seen corresponding path program 1 times [2021-11-16 20:31:20,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:31:20,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385693717] [2021-11-16 20:31:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:31:20,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:31:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:20,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:31:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:31:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:20,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:31:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:20,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 20:31:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:20,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:20,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:20,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 20:31:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:20,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:31:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:20,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:31:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:20,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:20,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:31:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:20,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:31:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-16 20:31:20,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:31:20,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385693717] [2021-11-16 20:31:20,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385693717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:31:20,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:31:20,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 20:31:20,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18829926] [2021-11-16 20:31:20,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:31:20,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 20:31:20,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:31:20,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 20:31:20,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:31:20,535 INFO L87 Difference]: Start difference. First operand 152 states and 180 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-16 20:31:22,564 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:31:24,615 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:31:26,667 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:31:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:31:26,949 INFO L93 Difference]: Finished difference Result 224 states and 264 transitions. [2021-11-16 20:31:26,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 20:31:26,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2021-11-16 20:31:26,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:31:26,952 INFO L225 Difference]: With dead ends: 224 [2021-11-16 20:31:26,952 INFO L226 Difference]: Without dead ends: 156 [2021-11-16 20:31:26,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:31:26,954 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 71 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 28 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-11-16 20:31:26,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 240 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 201 Invalid, 3 Unknown, 0 Unchecked, 6.4s Time] [2021-11-16 20:31:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-11-16 20:31:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2021-11-16 20:31:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.146788990825688) internal successors, (125), 114 states have internal predecessors, (125), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2021-11-16 20:31:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2021-11-16 20:31:26,964 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 85 [2021-11-16 20:31:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:31:26,965 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2021-11-16 20:31:26,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-16 20:31:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2021-11-16 20:31:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-16 20:31:26,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:31:26,966 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:31:26,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-16 20:31:26,967 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:31:26,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:31:26,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2136981433, now seen corresponding path program 1 times [2021-11-16 20:31:26,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:31:26,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338070811] [2021-11-16 20:31:26,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:31:26,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:31:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:27,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:31:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:27,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:31:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:27,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:31:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:27,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 20:31:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:27,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:27,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:27,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 20:31:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:27,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:31:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:27,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:31:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:27,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:27,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:31:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:27,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 20:31:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-16 20:31:27,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:31:27,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338070811] [2021-11-16 20:31:27,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338070811] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:31:27,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:31:27,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 20:31:27,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854415351] [2021-11-16 20:31:27,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:31:27,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 20:31:27,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:31:27,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 20:31:27,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:31:27,110 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-16 20:31:29,136 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:31:31,219 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:31:32,794 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:31:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:31:33,010 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2021-11-16 20:31:33,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 20:31:33,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2021-11-16 20:31:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:31:33,011 INFO L225 Difference]: With dead ends: 211 [2021-11-16 20:31:33,011 INFO L226 Difference]: Without dead ends: 100 [2021-11-16 20:31:33,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:31:33,012 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 63 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-11-16 20:31:33,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 231 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 186 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2021-11-16 20:31:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-16 20:31:33,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2021-11-16 20:31:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 71 states have internal predecessors, (74), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2021-11-16 20:31:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2021-11-16 20:31:33,016 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 87 [2021-11-16 20:31:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:31:33,017 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2021-11-16 20:31:33,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-16 20:31:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2021-11-16 20:31:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-16 20:31:33,017 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:31:33,018 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:31:33,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-16 20:31:33,018 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:31:33,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:31:33,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1322477714, now seen corresponding path program 1 times [2021-11-16 20:31:33,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:31:33,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421820417] [2021-11-16 20:31:33,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:31:33,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:31:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:31:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:31:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:31:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 20:31:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 20:31:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:31:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:31:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:31:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 20:31:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-11-16 20:31:33,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:31:33,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421820417] [2021-11-16 20:31:33,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421820417] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:31:33,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:31:33,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-16 20:31:33,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967350880] [2021-11-16 20:31:33,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:31:33,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 20:31:33,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:31:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 20:31:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:31:33,527 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-11-16 20:31:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:31:35,652 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2021-11-16 20:31:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 20:31:35,653 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 90 [2021-11-16 20:31:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:31:35,653 INFO L225 Difference]: With dead ends: 152 [2021-11-16 20:31:35,653 INFO L226 Difference]: Without dead ends: 95 [2021-11-16 20:31:35,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2021-11-16 20:31:35,654 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 189 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:31:35,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 229 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-16 20:31:35,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-16 20:31:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-11-16 20:31:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 69 states have internal predecessors, (70), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-16 20:31:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2021-11-16 20:31:35,658 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 90 [2021-11-16 20:31:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:31:35,658 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2021-11-16 20:31:35,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-11-16 20:31:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2021-11-16 20:31:35,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-16 20:31:35,658 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:31:35,659 INFO L514 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:31:35,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-16 20:31:35,659 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:31:35,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:31:35,659 INFO L85 PathProgramCache]: Analyzing trace with hash -11289161, now seen corresponding path program 1 times [2021-11-16 20:31:35,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:31:35,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175091854] [2021-11-16 20:31:35,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:31:35,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:31:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:35,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:31:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:35,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:31:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:35,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:31:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:35,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 20:31:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:35,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:35,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:35,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 20:31:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:35,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:31:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:35,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:31:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:36,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:36,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:31:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:36,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:31:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:36,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 20:31:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:36,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 20:31:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:36,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 20:31:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-16 20:31:36,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:31:36,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175091854] [2021-11-16 20:31:36,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175091854] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:31:36,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106777569] [2021-11-16 20:31:36,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:31:36,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:31:36,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:31:36,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:31:36,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-16 20:31:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:31:36,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 2557 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-16 20:31:36,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:31:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-11-16 20:31:37,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:31:37,904 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-16 20:31:37,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2021-11-16 20:31:38,021 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-16 20:31:38,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2021-11-16 20:31:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-16 20:31:38,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106777569] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 20:31:38,149 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 20:31:38,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 10] total 30 [2021-11-16 20:31:38,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861466031] [2021-11-16 20:31:38,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 20:31:38,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-16 20:31:38,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:31:38,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-16 20:31:38,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2021-11-16 20:31:38,151 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 30 states, 30 states have (on average 4.533333333333333) internal successors, (136), 28 states have internal predecessors, (136), 9 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (29), 9 states have call predecessors, (29), 8 states have call successors, (29) [2021-11-16 20:31:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:31:41,626 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2021-11-16 20:31:41,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-16 20:31:41,627 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.533333333333333) internal successors, (136), 28 states have internal predecessors, (136), 9 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (29), 9 states have call predecessors, (29), 8 states have call successors, (29) Word has length 116 [2021-11-16 20:31:41,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:31:41,627 INFO L225 Difference]: With dead ends: 124 [2021-11-16 20:31:41,627 INFO L226 Difference]: Without dead ends: 0 [2021-11-16 20:31:41,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 241 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=256, Invalid=1636, Unknown=0, NotChecked=0, Total=1892 [2021-11-16 20:31:41,628 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 425 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:31:41,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 599 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 782 Invalid, 0 Unknown, 155 Unchecked, 3.0s Time] [2021-11-16 20:31:41,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-16 20:31:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-16 20:31:41,629 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) [2021-11-16 20:31:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-16 20:31:41,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2021-11-16 20:31:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:31:41,629 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-16 20:31:41,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.533333333333333) internal successors, (136), 28 states have internal predecessors, (136), 9 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (29), 9 states have call predecessors, (29), 8 states have call successors, (29) [2021-11-16 20:31:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-16 20:31:41,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-16 20:31:41,631 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-16 20:31:41,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-16 20:31:41,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-16 20:31:41,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-16 20:31:43,829 INFO L854 garLoopResultBuilder]: At program point L6894(line 6894) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-16 20:31:43,829 INFO L854 garLoopResultBuilder]: At program point can_fail_mallocENTRY(lines 6893 6897) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-16 20:31:43,829 INFO L858 garLoopResultBuilder]: For program point L6896-1(line 6896) no Hoare annotation was computed. [2021-11-16 20:31:43,829 INFO L854 garLoopResultBuilder]: At program point L6896(line 6896) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-16 20:31:43,829 INFO L858 garLoopResultBuilder]: For program point L6894-3(lines 6894 6896) no Hoare annotation was computed. [2021-11-16 20:31:43,829 INFO L858 garLoopResultBuilder]: For program point L6894-1(lines 6894 6896) no Hoare annotation was computed. [2021-11-16 20:31:43,829 INFO L858 garLoopResultBuilder]: For program point can_fail_mallocFINAL(lines 6893 6897) no Hoare annotation was computed. [2021-11-16 20:31:43,829 INFO L858 garLoopResultBuilder]: For program point can_fail_mallocEXIT(lines 6893 6897) no Hoare annotation was computed. [2021-11-16 20:31:43,829 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6876 6881) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-16 20:31:43,829 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6876 6881) no Hoare annotation was computed. [2021-11-16 20:31:43,829 INFO L858 garLoopResultBuilder]: For program point L6877-1(lines 6877 6879) no Hoare annotation was computed. [2021-11-16 20:31:43,829 INFO L854 garLoopResultBuilder]: At program point L6877(lines 6877 6879) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-16 20:31:43,829 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6876 6881) no Hoare annotation was computed. [2021-11-16 20:31:43,829 INFO L854 garLoopResultBuilder]: At program point aws_mem_acquireENTRY(lines 6922 6932) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point aws_mem_acquireEXIT(lines 6922 6932) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point L6927(line 6927) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point L6929-1(line 6929) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L854 garLoopResultBuilder]: At program point L6929(line 6929) the Hoare annotation is: (or (and (< 0 (+ aws_mem_acquire_~mem~0.offset 1)) (<= aws_mem_acquire_~mem~0.base 0) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (<= aws_mem_acquire_~mem~0.offset 0) (< 0 (+ aws_mem_acquire_~mem~0.base 1))) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-16 20:31:43,830 INFO L854 garLoopResultBuilder]: At program point L6923-1(line 6923) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-16 20:31:43,830 INFO L854 garLoopResultBuilder]: At program point L6923(line 6923) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-16 20:31:43,830 INFO L854 garLoopResultBuilder]: At program point L6925-1(line 6925) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-16 20:31:43,830 INFO L854 garLoopResultBuilder]: At program point L6925(line 6925) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point aws_mem_acquireFINAL(lines 6922 6932) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point L6923-2(line 6923) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point L7162(line 7162) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7157 7163) the Hoare annotation is: true [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7157 7163) no Hoare annotation was computed. [2021-11-16 20:31:43,830 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7157 7163) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L854 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (= ~tl_last_error~0 |old(~tl_last_error~0)|) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7101) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6883 6885) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6883 6885) no Hoare annotation was computed. [2021-11-16 20:31:43,831 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6883 6885) the Hoare annotation is: true [2021-11-16 20:31:43,831 INFO L858 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6917 6920) no Hoare annotation was computed. [2021-11-16 20:31:43,832 INFO L858 garLoopResultBuilder]: For program point L6919-1(line 6919) no Hoare annotation was computed. [2021-11-16 20:31:43,832 INFO L861 garLoopResultBuilder]: At program point L6919(line 6919) the Hoare annotation is: true [2021-11-16 20:31:43,832 INFO L861 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6917 6920) the Hoare annotation is: true [2021-11-16 20:31:43,832 INFO L858 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6917 6920) no Hoare annotation was computed. [2021-11-16 20:31:43,832 INFO L858 garLoopResultBuilder]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2021-11-16 20:31:43,832 INFO L854 garLoopResultBuilder]: At program point L8752(line 8752) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1150#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1150#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-16 20:31:43,832 INFO L858 garLoopResultBuilder]: For program point L8752-1(line 8752) no Hoare annotation was computed. [2021-11-16 20:31:43,832 INFO L858 garLoopResultBuilder]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2021-11-16 20:31:43,832 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-16 20:31:43,832 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-16 20:31:43,832 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-16 20:31:43,832 INFO L854 garLoopResultBuilder]: At program point L7126(line 7126) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse14) 18446744073709551616))))) .cse10 .cse11 .cse12 .cse13)))) [2021-11-16 20:31:43,832 INFO L861 garLoopResultBuilder]: At program point L8757(line 8757) the Hoare annotation is: true [2021-11-16 20:31:43,832 INFO L858 garLoopResultBuilder]: For program point L7126-2(line 7126) no Hoare annotation was computed. [2021-11-16 20:31:43,832 INFO L854 garLoopResultBuilder]: At program point L7126-1(line 7126) the Hoare annotation is: (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse13 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse13 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse2 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse4 (<= 1 |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| 0))) (.cse7 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse19) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse9 (<= |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1| 1)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse19))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse17 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (let ((.cse12 (select .cse13 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse12 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse12) 18446744073709551616))))) .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse18) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse18) 0) .cse17))))) [2021-11-16 20:31:43,832 INFO L858 garLoopResultBuilder]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2021-11-16 20:31:43,832 INFO L858 garLoopResultBuilder]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2021-11-16 20:31:43,833 INFO L854 garLoopResultBuilder]: At program point L8753(line 8753) the Hoare annotation is: (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1151#1| 0) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-11-16 20:31:43,833 INFO L858 garLoopResultBuilder]: For program point L8753-1(line 8753) no Hoare annotation was computed. [2021-11-16 20:31:43,833 INFO L858 garLoopResultBuilder]: For program point L8741(lines 8741 8756) no Hoare annotation was computed. [2021-11-16 20:31:43,833 INFO L858 garLoopResultBuilder]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2021-11-16 20:31:43,833 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-16 20:31:43,833 INFO L854 garLoopResultBuilder]: At program point L7127(lines 7110 7128) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse14) 18446744073709551616))))) .cse10 .cse11 .cse12 .cse13) (and .cse3 .cse4 .cse5 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_byte_buf_init_#res#1| 1) 0) .cse10 .cse11 (not (= (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) .cse12 .cse13)))) [2021-11-16 20:31:43,833 INFO L854 garLoopResultBuilder]: At program point L8754(line 8754) the Hoare annotation is: (let ((.cse2 (div |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| 18446744073709551616)) (.cse3 (div |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1152#1| 18446744073709551616))) (let ((.cse1 (* 18446744073709551616 .cse3)) (.cse0 (+ (* 18446744073709551616 .cse2) |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1152#1|))) (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (< .cse0 (+ .cse1 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| 1)) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (<= .cse2 .cse3) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (<= (+ .cse1 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) .cse0) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)))) [2021-11-16 20:31:43,833 INFO L854 garLoopResultBuilder]: At program point L8746(line 8746) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) [2021-11-16 20:31:43,833 INFO L858 garLoopResultBuilder]: For program point L8754-1(line 8754) no Hoare annotation was computed. [2021-11-16 20:31:43,833 INFO L854 garLoopResultBuilder]: At program point L7111-1(line 7111) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2021-11-16 20:31:43,833 INFO L854 garLoopResultBuilder]: At program point L7111(line 7111) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2021-11-16 20:31:43,833 INFO L858 garLoopResultBuilder]: For program point L8746-1(line 8746) no Hoare annotation was computed. [2021-11-16 20:31:43,833 INFO L858 garLoopResultBuilder]: For program point L8751-2(line 8751) no Hoare annotation was computed. [2021-11-16 20:31:43,833 INFO L858 garLoopResultBuilder]: For program point L7116-1(line 7116) no Hoare annotation was computed. [2021-11-16 20:31:43,833 INFO L854 garLoopResultBuilder]: At program point L7116(line 7116) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (< (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2021-11-16 20:31:43,833 INFO L854 garLoopResultBuilder]: At program point L8751(line 8751) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse14) 18446744073709551616))))) .cse10 .cse11 .cse12 .cse13)))) [2021-11-16 20:31:43,833 INFO L854 garLoopResultBuilder]: At program point L8751-1(line 8751) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= 1 |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1149#1|) (<= |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1149#1| 1) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-16 20:31:43,834 INFO L858 garLoopResultBuilder]: For program point L7112(lines 7110 7128) no Hoare annotation was computed. [2021-11-16 20:31:43,834 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-16 20:31:43,834 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-11-16 20:31:43,834 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-16 20:31:43,834 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-11-16 20:31:43,834 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-11-16 20:31:43,834 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-16 20:31:43,839 INFO L732 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] [2021-11-16 20:31:43,840 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 20:31:43,848 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 20:31:43,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 20:31:43,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 20:31:43,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 20:31:43,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 20:31:43,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 20:31:43,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 20:31:43,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 20:31:43,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 20:31:43,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 20:31:43,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 20:31:43,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 20:31:43,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:31:43 BoogieIcfgContainer [2021-11-16 20:31:43,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 20:31:43,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 20:31:43,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 20:31:43,876 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 20:31:43,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:30:14" (3/4) ... [2021-11-16 20:31:43,880 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-16 20:31:43,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2021-11-16 20:31:43,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2021-11-16 20:31:43,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-11-16 20:31:43,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_acquire [2021-11-16 20:31:43,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-11-16 20:31:43,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-11-16 20:31:43,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-11-16 20:31:43,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-11-16 20:31:43,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2021-11-16 20:31:43,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-11-16 20:31:43,900 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 123 nodes and edges [2021-11-16 20:31:43,901 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2021-11-16 20:31:43,902 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-16 20:31:43,902 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-16 20:31:43,903 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-16 20:31:43,903 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-16 20:31:43,904 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-16 20:31:43,905 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-16 20:31:43,931 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][8 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && #memory_$Pointer$[buf][8 + buf] == 0) && s_can_fail_allocator_static <= 0) || (((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && buf == buf) && allocator == allocator) && allocator == allocator) && s_can_fail_allocator_static <= 0)) || ((((((((((0 <= s_can_fail_allocator_static && buf == 0) && capacity == capacity) && buf == buf) && !(buf == 0)) && \result + 1 <= 0) && buf == buf) && allocator == allocator) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && allocator == allocator) && s_can_fail_allocator_static <= 0) [2021-11-16 20:31:44,475 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-16 20:31:44,475 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 20:31:44,476 INFO L158 Benchmark]: Toolchain (without parser) took 93036.31ms. Allocated memory was 98.6MB in the beginning and 310.4MB in the end (delta: 211.8MB). Free memory was 59.1MB in the beginning and 195.7MB in the end (delta: -136.6MB). Peak memory consumption was 218.5MB. Max. memory is 16.1GB. [2021-11-16 20:31:44,476 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory was 55.7MB in the beginning and 55.6MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 20:31:44,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1690.85ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 58.7MB in the beginning and 57.5MB in the end (delta: 1.2MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2021-11-16 20:31:44,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 154.80ms. Allocated memory is still 127.9MB. Free memory was 57.5MB in the beginning and 46.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-16 20:31:44,476 INFO L158 Benchmark]: Boogie Preprocessor took 86.90ms. Allocated memory was 127.9MB in the beginning and 222.3MB in the end (delta: 94.4MB). Free memory was 46.4MB in the beginning and 167.7MB in the end (delta: -121.2MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2021-11-16 20:31:44,477 INFO L158 Benchmark]: RCFGBuilder took 1465.87ms. Allocated memory is still 222.3MB. Free memory was 167.7MB in the beginning and 107.3MB in the end (delta: 60.4MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. [2021-11-16 20:31:44,477 INFO L158 Benchmark]: TraceAbstraction took 89032.15ms. Allocated memory was 222.3MB in the beginning and 310.4MB in the end (delta: 88.1MB). Free memory was 107.3MB in the beginning and 112.8MB in the end (delta: -5.5MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. [2021-11-16 20:31:44,477 INFO L158 Benchmark]: Witness Printer took 599.42ms. Allocated memory is still 310.4MB. Free memory was 112.8MB in the beginning and 195.7MB in the end (delta: -82.9MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2021-11-16 20:31:44,478 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.15ms. Allocated memory is still 98.6MB. Free memory was 55.7MB in the beginning and 55.6MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1690.85ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 58.7MB in the beginning and 57.5MB in the end (delta: 1.2MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 154.80ms. Allocated memory is still 127.9MB. Free memory was 57.5MB in the beginning and 46.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.90ms. Allocated memory was 127.9MB in the beginning and 222.3MB in the end (delta: 94.4MB). Free memory was 46.4MB in the beginning and 167.7MB in the end (delta: -121.2MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1465.87ms. Allocated memory is still 222.3MB. Free memory was 167.7MB in the beginning and 107.3MB in the end (delta: 60.4MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. * TraceAbstraction took 89032.15ms. Allocated memory was 222.3MB in the beginning and 310.4MB in the end (delta: 88.1MB). Free memory was 107.3MB in the beginning and 112.8MB in the end (delta: -5.5MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. * Witness Printer took 599.42ms. Allocated memory is still 310.4MB. Free memory was 112.8MB in the beginning and 195.7MB in the end (delta: -82.9MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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 11 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 88.9s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 74.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 2698 SdHoareTripleChecker+Valid, 72.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2574 mSDsluCounter, 15688 SdHoareTripleChecker+Invalid, 69.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 329 IncrementalHoareTripleChecker+Unchecked, 12866 mSDsCounter, 656 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5582 IncrementalHoareTripleChecker+Invalid, 6580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 656 mSolverCounterUnsat, 2822 mSDtfsCounter, 5582 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1061 GetRequests, 725 SyntacticMatches, 9 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=17, InterpolantAutomatonStates: 250, 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, 27 MinimizatonAttempts, 367 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 185 PreInvPairs, 212 NumberOfFragments, 1272 HoareAnnotationTreeSize, 185 FomulaSimplifications, 208 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 32 FomulaSimplificationsInter, 104312 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 1776 NumberOfCodeBlocks, 1776 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1922 ConstructedInterpolants, 38 QuantifiedInterpolants, 10275 SizeOfPredicates, 40 NumberOfNonLiveVariables, 4960 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 576/635 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: 7110]: Loop Invariant [2021-11-16 20:31:44,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 20:31:44,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 20:31:44,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 20:31:44,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 20:31:44,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 20:31:44,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 20:31:44,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 20:31:44,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 20:31:44,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 20:31:44,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 20:31:44,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 20:31:44,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][8 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && #memory_$Pointer$[buf][8 + buf] == 0) && s_can_fail_allocator_static <= 0) || (((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && buf == buf) && allocator == allocator) && allocator == allocator) && s_can_fail_allocator_static <= 0)) || ((((((((((0 <= s_can_fail_allocator_static && buf == 0) && capacity == capacity) && buf == buf) && !(buf == 0)) && \result + 1 <= 0) && buf == buf) && allocator == allocator) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && allocator == allocator) && s_can_fail_allocator_static <= 0) - InvariantResult [Line: 8757]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-16 20:31:44,535 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