./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 22:12:23,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:12:23,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:12:23,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:12:23,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:12:23,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:12:23,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:12:23,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:12:23,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:12:23,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:12:23,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:12:23,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:12:23,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:12:23,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:12:23,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:12:23,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:12:23,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:12:23,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:12:23,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:12:23,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:12:23,235 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:12:23,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:12:23,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:12:23,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:12:23,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:12:23,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:12:23,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:12:23,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:12:23,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:12:23,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:12:23,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:12:23,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:12:23,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:12:23,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:12:23,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:12:23,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:12:23,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:12:23,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:12:23,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:12:23,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:12:23,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:12:23,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:12:23,254 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:12:23,280 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:12:23,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:12:23,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:12:23,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:12:23,283 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:12:23,283 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:12:23,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:12:23,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:12:23,284 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:12:23,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:12:23,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:12:23,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:12:23,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:12:23,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:12:23,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:12:23,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:12:23,286 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:12:23,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:12:23,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:12:23,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:12:23,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:12:23,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:12:23,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:12:23,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:12:23,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:12:23,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:12:23,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:12:23,290 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:12:23,290 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:12:23,290 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:12:23,290 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 -> bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c [2022-07-22 22:12:23,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:12:23,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:12:23,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:12:23,534 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:12:23,535 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:12:23,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2022-07-22 22:12:23,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c64a27e84/c09a4abaa3ab45f182534db458fb1b4f/FLAGbeb54ba29 [2022-07-22 22:12:24,322 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:12:24,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2022-07-22 22:12:24,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c64a27e84/c09a4abaa3ab45f182534db458fb1b4f/FLAGbeb54ba29 [2022-07-22 22:12:24,586 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c64a27e84/c09a4abaa3ab45f182534db458fb1b4f [2022-07-22 22:12:24,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:12:24,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:12:24,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:12:24,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:12:24,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:12:24,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:12:24" (1/1) ... [2022-07-22 22:12:24,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b1b4a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:12:24, skipping insertion in model container [2022-07-22 22:12:24,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:12:24" (1/1) ... [2022-07-22 22:12:24,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:12:24,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:12:24,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2022-07-22 22:12:24,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2022-07-22 22:12:25,573 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:25,574 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:25,574 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:25,575 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:25,576 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:25,586 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:25,587 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:25,588 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:25,589 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:25,818 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:12:25,819 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:12:25,820 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:12:25,821 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:12:25,822 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:12:25,823 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:12:25,823 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:12:25,824 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:12:25,824 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:12:25,825 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:12:25,952 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:12:26,070 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:26,071 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:26,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:12:26,202 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:12:26,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2022-07-22 22:12:26,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2022-07-22 22:12:26,259 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:26,260 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:26,261 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:26,261 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:26,264 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:26,269 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:26,270 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:26,271 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:26,271 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:26,326 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:12:26,344 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:12:26,344 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:12:26,345 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:12:26,346 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:12:26,346 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:12:26,346 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:12:26,347 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:12:26,347 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:12:26,348 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:12:26,388 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:12:26,466 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:26,466 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:12:26,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:12:26,709 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:12:26,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:12:26 WrapperNode [2022-07-22 22:12:26,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:12:26,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:12:26,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:12:26,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:12:26,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:12:26" (1/1) ... [2022-07-22 22:12:26,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:12:26" (1/1) ... [2022-07-22 22:12:26,871 INFO L137 Inliner]: procedures = 690, calls = 2615, calls flagged for inlining = 57, calls inlined = 4, statements flattened = 766 [2022-07-22 22:12:26,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:12:26,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:12:26,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:12:26,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:12:26,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:12:26" (1/1) ... [2022-07-22 22:12:26,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:12:26" (1/1) ... [2022-07-22 22:12:26,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:12:26" (1/1) ... [2022-07-22 22:12:26,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:12:26" (1/1) ... [2022-07-22 22:12:26,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:12:26" (1/1) ... [2022-07-22 22:12:26,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:12:26" (1/1) ... [2022-07-22 22:12:26,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:12:26" (1/1) ... [2022-07-22 22:12:26,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:12:26,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:12:26,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:12:26,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:12:26,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:12:26" (1/1) ... [2022-07-22 22:12:26,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:12:26,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:12:27,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 22:12:27,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 22:12:27,060 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-22 22:12:27,060 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-22 22:12:27,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 22:12:27,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:12:27,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 22:12:27,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 22:12:27,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:12:27,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 22:12:27,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:12:27,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:12:27,063 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-22 22:12:27,063 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-22 22:12:27,063 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 22:12:27,063 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 22:12:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 22:12:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 22:12:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:12:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-22 22:12:27,064 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-22 22:12:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 22:12:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:12:27,065 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_from_array [2022-07-22 22:12:27,065 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_from_array [2022-07-22 22:12:27,340 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:12:27,342 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:12:28,201 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:12:28,208 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:12:28,208 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 22:12:28,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:12:28 BoogieIcfgContainer [2022-07-22 22:12:28,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:12:28,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:12:28,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:12:28,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:12:28,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:12:24" (1/3) ... [2022-07-22 22:12:28,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756ef41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:12:28, skipping insertion in model container [2022-07-22 22:12:28,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:12:26" (2/3) ... [2022-07-22 22:12:28,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756ef41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:12:28, skipping insertion in model container [2022-07-22 22:12:28,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:12:28" (3/3) ... [2022-07-22 22:12:28,219 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_array_harness.i [2022-07-22 22:12:28,230 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:12:28,231 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:12:28,300 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:12:28,311 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@29ca6a40, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e3770d8 [2022-07-22 22:12:28,311 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:12:28,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 53 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-22 22:12:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-22 22:12:28,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:28,322 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:28,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:28,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:28,328 INFO L85 PathProgramCache]: Analyzing trace with hash -537066619, now seen corresponding path program 1 times [2022-07-22 22:12:28,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:28,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314980013] [2022-07-22 22:12:28,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:28,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:28,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:28,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:28,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:12:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:28,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:12:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:28,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:28,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314980013] [2022-07-22 22:12:28,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314980013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:28,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:28,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 22:12:28,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54983705] [2022-07-22 22:12:28,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:28,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:12:28,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:28,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:12:28,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:12:28,884 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 53 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:29,006 INFO L93 Difference]: Finished difference Result 145 states and 195 transitions. [2022-07-22 22:12:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:12:29,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-07-22 22:12:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:29,015 INFO L225 Difference]: With dead ends: 145 [2022-07-22 22:12:29,015 INFO L226 Difference]: Without dead ends: 68 [2022-07-22 22:12:29,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:12:29,021 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:29,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 113 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:12:29,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-22 22:12:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-22 22:12:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-22 22:12:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2022-07-22 22:12:29,083 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 33 [2022-07-22 22:12:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:29,083 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2022-07-22 22:12:29,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2022-07-22 22:12:29,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-22 22:12:29,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:29,087 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:29,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 22:12:29,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:29,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:29,088 INFO L85 PathProgramCache]: Analyzing trace with hash 365093061, now seen corresponding path program 1 times [2022-07-22 22:12:29,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:29,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125291770] [2022-07-22 22:12:29,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:29,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:29,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:29,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:29,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:12:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:29,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:12:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:29,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:29,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125291770] [2022-07-22 22:12:29,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125291770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:29,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:29,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:12:29,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175547100] [2022-07-22 22:12:29,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:29,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:12:29,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:29,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:12:29,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:12:29,396 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:29,646 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2022-07-22 22:12:29,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:12:29,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-07-22 22:12:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:29,649 INFO L225 Difference]: With dead ends: 123 [2022-07-22 22:12:29,649 INFO L226 Difference]: Without dead ends: 71 [2022-07-22 22:12:29,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:12:29,651 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:29,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 156 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:12:29,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-22 22:12:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-22 22:12:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.1875) internal successors, (57), 50 states have internal predecessors, (57), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-07-22 22:12:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2022-07-22 22:12:29,661 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 33 [2022-07-22 22:12:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:29,662 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2022-07-22 22:12:29,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-07-22 22:12:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 22:12:29,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:29,664 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:29,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 22:12:29,664 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:29,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:29,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1309209872, now seen corresponding path program 1 times [2022-07-22 22:12:29,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:29,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983725370] [2022-07-22 22:12:29,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:29,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:29,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:12:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:29,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:12:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:29,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:29,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983725370] [2022-07-22 22:12:29,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983725370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:29,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:29,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:12:29,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134114185] [2022-07-22 22:12:29,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:29,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:12:29,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:29,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:12:29,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:12:29,976 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 22:12:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:30,342 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2022-07-22 22:12:30,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:12:30,343 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2022-07-22 22:12:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:30,344 INFO L225 Difference]: With dead ends: 83 [2022-07-22 22:12:30,344 INFO L226 Difference]: Without dead ends: 81 [2022-07-22 22:12:30,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:12:30,346 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 60 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:30,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 305 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:12:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-22 22:12:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-07-22 22:12:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 57 states have internal predecessors, (63), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-07-22 22:12:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2022-07-22 22:12:30,359 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 39 [2022-07-22 22:12:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:30,360 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2022-07-22 22:12:30,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 22:12:30,361 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2022-07-22 22:12:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 22:12:30,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:30,366 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:30,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 22:12:30,366 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:30,367 INFO L85 PathProgramCache]: Analyzing trace with hash -853000232, now seen corresponding path program 1 times [2022-07-22 22:12:30,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:30,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912040943] [2022-07-22 22:12:30,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:30,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:30,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:30,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:12:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:30,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:12:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:30,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:30,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912040943] [2022-07-22 22:12:30,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912040943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:30,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:30,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:12:30,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006040987] [2022-07-22 22:12:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:30,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:12:30,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:12:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:12:30,681 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 22:12:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:30,988 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions. [2022-07-22 22:12:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:12:30,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-07-22 22:12:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:30,990 INFO L225 Difference]: With dead ends: 164 [2022-07-22 22:12:30,991 INFO L226 Difference]: Without dead ends: 105 [2022-07-22 22:12:30,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:12:30,992 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 100 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:30,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 188 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:12:30,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-22 22:12:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2022-07-22 22:12:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 62 states have internal predecessors, (70), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-07-22 22:12:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2022-07-22 22:12:31,008 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 43 [2022-07-22 22:12:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:31,009 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2022-07-22 22:12:31,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 22:12:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2022-07-22 22:12:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 22:12:31,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:31,015 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:31,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 22:12:31,016 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:31,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash -594834794, now seen corresponding path program 1 times [2022-07-22 22:12:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:31,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617779107] [2022-07-22 22:12:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:31,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:31,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:31,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:31,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:12:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:31,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:12:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:31,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617779107] [2022-07-22 22:12:31,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617779107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:31,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:31,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:12:31,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676331651] [2022-07-22 22:12:31,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:31,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:12:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:31,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:12:31,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:12:31,476 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:31,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:31,965 INFO L93 Difference]: Finished difference Result 180 states and 226 transitions. [2022-07-22 22:12:31,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:12:31,966 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-07-22 22:12:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:31,967 INFO L225 Difference]: With dead ends: 180 [2022-07-22 22:12:31,967 INFO L226 Difference]: Without dead ends: 111 [2022-07-22 22:12:31,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:12:31,969 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:31,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 235 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:12:31,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-22 22:12:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-07-22 22:12:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 83 states have internal predecessors, (93), 17 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-07-22 22:12:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2022-07-22 22:12:31,982 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 43 [2022-07-22 22:12:31,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:31,983 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2022-07-22 22:12:31,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2022-07-22 22:12:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 22:12:31,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:31,984 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:31,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 22:12:31,986 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:31,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1874698472, now seen corresponding path program 1 times [2022-07-22 22:12:31,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:31,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105674321] [2022-07-22 22:12:31,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:31,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:32,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:32,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:32,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:12:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:32,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:12:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:32,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:32,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105674321] [2022-07-22 22:12:32,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105674321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:32,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:32,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:12:32,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621712745] [2022-07-22 22:12:32,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:32,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:12:32,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:32,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:12:32,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:12:32,688 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:33,140 INFO L93 Difference]: Finished difference Result 223 states and 282 transitions. [2022-07-22 22:12:33,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:12:33,140 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-07-22 22:12:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:33,142 INFO L225 Difference]: With dead ends: 223 [2022-07-22 22:12:33,142 INFO L226 Difference]: Without dead ends: 135 [2022-07-22 22:12:33,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:12:33,144 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 146 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:33,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 241 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:12:33,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-22 22:12:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 103. [2022-07-22 22:12:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 80 states have internal predecessors, (89), 17 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-07-22 22:12:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2022-07-22 22:12:33,173 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 43 [2022-07-22 22:12:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:33,173 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2022-07-22 22:12:33,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2022-07-22 22:12:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 22:12:33,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:33,175 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:33,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 22:12:33,175 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:33,176 INFO L85 PathProgramCache]: Analyzing trace with hash 573755484, now seen corresponding path program 1 times [2022-07-22 22:12:33,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:33,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013650043] [2022-07-22 22:12:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:33,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:33,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:12:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:33,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:12:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 22:12:34,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:34,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013650043] [2022-07-22 22:12:34,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013650043] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:12:34,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802595637] [2022-07-22 22:12:34,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:34,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:12:34,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:12:34,026 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:12:34,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 22:12:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:34,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 2427 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-22 22:12:34,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:12:34,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:12:34,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:12:34,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:12:34,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-22 22:12:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:35,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:12:35,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802595637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:35,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:12:35,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2022-07-22 22:12:35,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738591197] [2022-07-22 22:12:35,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:35,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:12:35,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:35,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:12:35,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-07-22 22:12:35,064 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:35,128 INFO L93 Difference]: Finished difference Result 243 states and 303 transitions. [2022-07-22 22:12:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:12:35,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-07-22 22:12:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:35,131 INFO L225 Difference]: With dead ends: 243 [2022-07-22 22:12:35,131 INFO L226 Difference]: Without dead ends: 150 [2022-07-22 22:12:35,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-07-22 22:12:35,132 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 27 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:35,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 542 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 120 Unchecked, 0.0s Time] [2022-07-22 22:12:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-22 22:12:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2022-07-22 22:12:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 117 states have internal predecessors, (134), 17 states have call successors, (17), 8 states have call predecessors, (17), 14 states have return successors, (27), 15 states have call predecessors, (27), 16 states have call successors, (27) [2022-07-22 22:12:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2022-07-22 22:12:35,145 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 43 [2022-07-22 22:12:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:35,145 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2022-07-22 22:12:35,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2022-07-22 22:12:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 22:12:35,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:35,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:35,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 22:12:35,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:12:35,380 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:35,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash 831920922, now seen corresponding path program 1 times [2022-07-22 22:12:35,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:35,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143482781] [2022-07-22 22:12:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:35,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:35,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:35,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:35,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:12:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:35,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:12:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:35,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:35,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143482781] [2022-07-22 22:12:35,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143482781] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:35,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:35,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:12:35,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73744956] [2022-07-22 22:12:35,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:35,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:12:35,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:35,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:12:35,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:12:35,578 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 22:12:35,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:35,839 INFO L93 Difference]: Finished difference Result 234 states and 294 transitions. [2022-07-22 22:12:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:12:35,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-07-22 22:12:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:35,840 INFO L225 Difference]: With dead ends: 234 [2022-07-22 22:12:35,840 INFO L226 Difference]: Without dead ends: 139 [2022-07-22 22:12:35,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:12:35,841 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 63 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:35,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 174 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:12:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-22 22:12:35,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2022-07-22 22:12:35,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 99 states have internal predecessors, (110), 17 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-07-22 22:12:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. [2022-07-22 22:12:35,851 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 151 transitions. Word has length 43 [2022-07-22 22:12:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:35,851 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 151 transitions. [2022-07-22 22:12:35,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 22:12:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2022-07-22 22:12:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 22:12:35,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:35,852 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:35,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 22:12:35,853 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash -375980076, now seen corresponding path program 1 times [2022-07-22 22:12:35,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:35,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499714031] [2022-07-22 22:12:35,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:35,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:36,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:36,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:36,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:12:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:36,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:12:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:36,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:36,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499714031] [2022-07-22 22:12:36,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499714031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:36,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:36,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:12:36,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831771598] [2022-07-22 22:12:36,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:36,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:12:36,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:36,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:12:36,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:12:36,251 INFO L87 Difference]: Start difference. First operand 123 states and 151 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:36,804 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2022-07-22 22:12:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:12:36,805 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-07-22 22:12:36,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:36,806 INFO L225 Difference]: With dead ends: 220 [2022-07-22 22:12:36,806 INFO L226 Difference]: Without dead ends: 140 [2022-07-22 22:12:36,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:12:36,807 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 124 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:36,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 261 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:12:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-22 22:12:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2022-07-22 22:12:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 104 states have internal predecessors, (117), 17 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-07-22 22:12:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2022-07-22 22:12:36,815 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 43 [2022-07-22 22:12:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:36,818 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2022-07-22 22:12:36,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-07-22 22:12:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 22:12:36,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:36,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:36,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 22:12:36,820 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:36,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1655843754, now seen corresponding path program 1 times [2022-07-22 22:12:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:36,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124085531] [2022-07-22 22:12:36,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:36,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:37,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:37,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:37,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:12:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:37,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:12:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:37,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:37,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124085531] [2022-07-22 22:12:37,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124085531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:37,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:37,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:12:37,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557387211] [2022-07-22 22:12:37,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:37,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:12:37,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:37,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:12:37,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:12:37,144 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:37,599 INFO L93 Difference]: Finished difference Result 234 states and 288 transitions. [2022-07-22 22:12:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:12:37,600 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-07-22 22:12:37,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:37,601 INFO L225 Difference]: With dead ends: 234 [2022-07-22 22:12:37,601 INFO L226 Difference]: Without dead ends: 144 [2022-07-22 22:12:37,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:12:37,602 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 131 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:37,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 217 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:12:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-22 22:12:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2022-07-22 22:12:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 89 states have (on average 1.1910112359550562) internal successors, (106), 94 states have internal predecessors, (106), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2022-07-22 22:12:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2022-07-22 22:12:37,610 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 43 [2022-07-22 22:12:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:37,610 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2022-07-22 22:12:37,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2022-07-22 22:12:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 22:12:37,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:37,612 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:37,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 22:12:37,612 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:37,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2043381215, now seen corresponding path program 1 times [2022-07-22 22:12:37,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:37,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567333720] [2022-07-22 22:12:37,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:37,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:37,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:37,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:37,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:12:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:37,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:12:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:37,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:37,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567333720] [2022-07-22 22:12:37,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567333720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:37,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:37,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 22:12:37,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550009281] [2022-07-22 22:12:37,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:37,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:12:37,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:37,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:12:37,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:12:37,843 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 22:12:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:38,231 INFO L93 Difference]: Finished difference Result 140 states and 169 transitions. [2022-07-22 22:12:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:12:38,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2022-07-22 22:12:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:38,233 INFO L225 Difference]: With dead ends: 140 [2022-07-22 22:12:38,233 INFO L226 Difference]: Without dead ends: 138 [2022-07-22 22:12:38,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:12:38,234 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 65 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:38,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 374 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:12:38,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-22 22:12:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2022-07-22 22:12:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.1808510638297873) internal successors, (111), 100 states have internal predecessors, (111), 17 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (25), 15 states have call predecessors, (25), 16 states have call successors, (25) [2022-07-22 22:12:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2022-07-22 22:12:38,247 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 45 [2022-07-22 22:12:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:38,249 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2022-07-22 22:12:38,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 22:12:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2022-07-22 22:12:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 22:12:38,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:38,250 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:38,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 22:12:38,251 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:38,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:38,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1342316637, now seen corresponding path program 1 times [2022-07-22 22:12:38,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:38,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847942363] [2022-07-22 22:12:38,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:38,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:38,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:12:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:38,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:12:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:38,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:38,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847942363] [2022-07-22 22:12:38,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847942363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:38,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:38,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-22 22:12:38,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537726270] [2022-07-22 22:12:38,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:38,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 22:12:38,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 22:12:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2022-07-22 22:12:38,797 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. Second operand has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 22:12:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:39,816 INFO L93 Difference]: Finished difference Result 149 states and 178 transitions. [2022-07-22 22:12:39,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 22:12:39,817 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2022-07-22 22:12:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:39,818 INFO L225 Difference]: With dead ends: 149 [2022-07-22 22:12:39,818 INFO L226 Difference]: Without dead ends: 147 [2022-07-22 22:12:39,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2022-07-22 22:12:39,819 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 91 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:39,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 478 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 22:12:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-22 22:12:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2022-07-22 22:12:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.1808510638297873) internal successors, (111), 100 states have internal predecessors, (111), 17 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (25), 15 states have call predecessors, (25), 16 states have call successors, (25) [2022-07-22 22:12:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2022-07-22 22:12:39,826 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 45 [2022-07-22 22:12:39,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:39,826 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2022-07-22 22:12:39,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 22:12:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2022-07-22 22:12:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 22:12:39,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:39,827 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:39,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 22:12:39,828 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:39,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1476330143, now seen corresponding path program 1 times [2022-07-22 22:12:39,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:39,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35865583] [2022-07-22 22:12:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:39,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:39,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:39,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:12:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:12:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:40,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:40,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35865583] [2022-07-22 22:12:40,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35865583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:40,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:40,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:12:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129520521] [2022-07-22 22:12:40,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:40,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:12:40,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:40,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:12:40,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:12:40,075 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:40,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:40,424 INFO L93 Difference]: Finished difference Result 217 states and 263 transitions. [2022-07-22 22:12:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:12:40,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-07-22 22:12:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:40,426 INFO L225 Difference]: With dead ends: 217 [2022-07-22 22:12:40,426 INFO L226 Difference]: Without dead ends: 136 [2022-07-22 22:12:40,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:12:40,427 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 55 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:40,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 227 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:12:40,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-22 22:12:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 123. [2022-07-22 22:12:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.1808510638297873) internal successors, (111), 100 states have internal predecessors, (111), 16 states have call successors, (16), 8 states have call predecessors, (16), 12 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-22 22:12:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2022-07-22 22:12:40,433 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 45 [2022-07-22 22:12:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:40,434 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2022-07-22 22:12:40,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:12:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2022-07-22 22:12:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-22 22:12:40,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:40,434 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:40,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 22:12:40,435 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:40,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash 316076503, now seen corresponding path program 1 times [2022-07-22 22:12:40,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:40,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212691517] [2022-07-22 22:12:40,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:40,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:40,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:40,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:40,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:40,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:40,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:40,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:12:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:40,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:12:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:40,597 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 22:12:40,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:40,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212691517] [2022-07-22 22:12:40,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212691517] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:12:40,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008103110] [2022-07-22 22:12:40,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:40,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:12:40,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:12:40,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:12:40,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 22:12:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 2481 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 22:12:41,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:12:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 22:12:41,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:12:41,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008103110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:41,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:12:41,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-22 22:12:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620952814] [2022-07-22 22:12:41,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:41,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:12:41,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:41,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:12:41,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:12:41,062 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 22:12:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:41,089 INFO L93 Difference]: Finished difference Result 216 states and 262 transitions. [2022-07-22 22:12:41,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:12:41,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2022-07-22 22:12:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:41,092 INFO L225 Difference]: With dead ends: 216 [2022-07-22 22:12:41,093 INFO L226 Difference]: Without dead ends: 127 [2022-07-22 22:12:41,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:12:41,094 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 21 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:41,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 243 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:12:41,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-22 22:12:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2022-07-22 22:12:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 91 states have (on average 1.1538461538461537) internal successors, (105), 96 states have internal predecessors, (105), 16 states have call successors, (16), 8 states have call predecessors, (16), 11 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2022-07-22 22:12:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2022-07-22 22:12:41,103 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 54 [2022-07-22 22:12:41,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:41,103 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2022-07-22 22:12:41,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 22:12:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2022-07-22 22:12:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-22 22:12:41,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:41,104 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:41,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-22 22:12:41,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 22:12:41,324 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:41,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:41,324 INFO L85 PathProgramCache]: Analyzing trace with hash 691123421, now seen corresponding path program 1 times [2022-07-22 22:12:41,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:41,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968395693] [2022-07-22 22:12:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:41,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:12:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:12:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 22:12:41,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:41,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968395693] [2022-07-22 22:12:41,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968395693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:41,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:41,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 22:12:41,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256868364] [2022-07-22 22:12:41,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:41,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:12:41,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:41,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:12:41,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:12:41,561 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 22:12:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:41,748 INFO L93 Difference]: Finished difference Result 151 states and 178 transitions. [2022-07-22 22:12:41,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:12:41,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2022-07-22 22:12:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:41,749 INFO L225 Difference]: With dead ends: 151 [2022-07-22 22:12:41,749 INFO L226 Difference]: Without dead ends: 119 [2022-07-22 22:12:41,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:12:41,750 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:41,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 128 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:12:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-22 22:12:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-22 22:12:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 96 states have internal predecessors, (104), 16 states have call successors, (16), 8 states have call predecessors, (16), 11 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2022-07-22 22:12:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2022-07-22 22:12:41,759 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 54 [2022-07-22 22:12:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:41,760 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2022-07-22 22:12:41,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 22:12:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2022-07-22 22:12:41,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 22:12:41,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:41,761 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:41,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 22:12:41,761 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash -324954328, now seen corresponding path program 1 times [2022-07-22 22:12:41,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:41,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794724217] [2022-07-22 22:12:41,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:12:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:12:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 22:12:41,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:41,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794724217] [2022-07-22 22:12:41,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794724217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:41,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:41,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:12:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449931337] [2022-07-22 22:12:41,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:41,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:12:41,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:41,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:12:41,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:12:41,993 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-22 22:12:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:42,324 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2022-07-22 22:12:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:12:42,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2022-07-22 22:12:42,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:42,325 INFO L225 Difference]: With dead ends: 131 [2022-07-22 22:12:42,326 INFO L226 Difference]: Without dead ends: 129 [2022-07-22 22:12:42,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:12:42,326 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 92 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:42,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 284 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:12:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-22 22:12:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-07-22 22:12:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 97 states have (on average 1.134020618556701) internal successors, (110), 103 states have internal predecessors, (110), 17 states have call successors, (17), 9 states have call predecessors, (17), 13 states have return successors, (23), 15 states have call predecessors, (23), 16 states have call successors, (23) [2022-07-22 22:12:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 150 transitions. [2022-07-22 22:12:42,332 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 150 transitions. Word has length 60 [2022-07-22 22:12:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:42,333 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 150 transitions. [2022-07-22 22:12:42,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-22 22:12:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 150 transitions. [2022-07-22 22:12:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-22 22:12:42,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:42,334 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:42,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 22:12:42,334 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:42,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:42,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2057101486, now seen corresponding path program 1 times [2022-07-22 22:12:42,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:42,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235367828] [2022-07-22 22:12:42,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:42,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:42,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:42,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:42,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:42,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:42,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:12:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:42,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:12:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 22:12:42,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:42,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235367828] [2022-07-22 22:12:42,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235367828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:42,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:42,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 22:12:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288692711] [2022-07-22 22:12:42,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:42,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:12:42,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:42,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:12:42,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:12:42,756 INFO L87 Difference]: Start difference. First operand 128 states and 150 transitions. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-22 22:12:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:43,502 INFO L93 Difference]: Finished difference Result 190 states and 233 transitions. [2022-07-22 22:12:43,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 22:12:43,502 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2022-07-22 22:12:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:43,504 INFO L225 Difference]: With dead ends: 190 [2022-07-22 22:12:43,505 INFO L226 Difference]: Without dead ends: 161 [2022-07-22 22:12:43,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:12:43,506 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 181 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:43,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 255 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 22:12:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-22 22:12:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2022-07-22 22:12:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 116 states have internal predecessors, (124), 19 states have call successors, (19), 9 states have call predecessors, (19), 15 states have return successors, (31), 18 states have call predecessors, (31), 18 states have call successors, (31) [2022-07-22 22:12:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 174 transitions. [2022-07-22 22:12:43,523 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 174 transitions. Word has length 64 [2022-07-22 22:12:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:43,523 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 174 transitions. [2022-07-22 22:12:43,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-22 22:12:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2022-07-22 22:12:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-22 22:12:43,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:43,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:43,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 22:12:43,527 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:43,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:43,527 INFO L85 PathProgramCache]: Analyzing trace with hash 777237808, now seen corresponding path program 1 times [2022-07-22 22:12:43,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:43,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785220040] [2022-07-22 22:12:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:43,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:43,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:43,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:43,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:43,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:43,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:43,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:12:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:43,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:12:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 22:12:43,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:43,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785220040] [2022-07-22 22:12:43,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785220040] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:12:43,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84886150] [2022-07-22 22:12:43,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:43,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:12:43,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:12:43,976 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:12:43,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 22:12:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:44,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 2508 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-22 22:12:44,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:12:44,667 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-07-22 22:12:44,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2022-07-22 22:12:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:45,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:12:45,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84886150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:45,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:12:45,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 29 [2022-07-22 22:12:45,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965055073] [2022-07-22 22:12:45,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:45,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 22:12:45,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:45,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 22:12:45,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2022-07-22 22:12:45,466 INFO L87 Difference]: Start difference. First operand 144 states and 174 transitions. Second operand has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-22 22:12:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:45,686 INFO L93 Difference]: Finished difference Result 231 states and 276 transitions. [2022-07-22 22:12:45,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 22:12:45,686 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2022-07-22 22:12:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:45,687 INFO L225 Difference]: With dead ends: 231 [2022-07-22 22:12:45,687 INFO L226 Difference]: Without dead ends: 189 [2022-07-22 22:12:45,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2022-07-22 22:12:45,689 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 19 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:45,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 987 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 173 Unchecked, 0.1s Time] [2022-07-22 22:12:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-22 22:12:45,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 181. [2022-07-22 22:12:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 141 states have (on average 1.148936170212766) internal successors, (162), 147 states have internal predecessors, (162), 21 states have call successors, (21), 12 states have call predecessors, (21), 18 states have return successors, (36), 21 states have call predecessors, (36), 20 states have call successors, (36) [2022-07-22 22:12:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 219 transitions. [2022-07-22 22:12:45,699 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 219 transitions. Word has length 64 [2022-07-22 22:12:45,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:45,699 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 219 transitions. [2022-07-22 22:12:45,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-22 22:12:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 219 transitions. [2022-07-22 22:12:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-22 22:12:45,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:45,701 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:45,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 22:12:45,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-22 22:12:45,923 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:45,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1069275532, now seen corresponding path program 1 times [2022-07-22 22:12:45,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:45,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585022315] [2022-07-22 22:12:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:45,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:46,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:46,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:46,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:46,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:46,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:46,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:12:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:12:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 22:12:46,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:46,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585022315] [2022-07-22 22:12:46,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585022315] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:12:46,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132134193] [2022-07-22 22:12:46,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:46,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:12:46,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:12:46,360 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:12:46,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 22:12:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:46,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-22 22:12:46,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:12:46,991 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-07-22 22:12:46,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2022-07-22 22:12:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:47,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:12:47,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132134193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:47,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:12:47,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [15] total 30 [2022-07-22 22:12:47,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636869451] [2022-07-22 22:12:47,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:47,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 22:12:47,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:47,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 22:12:47,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2022-07-22 22:12:47,985 INFO L87 Difference]: Start difference. First operand 181 states and 219 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-22 22:12:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:48,137 INFO L93 Difference]: Finished difference Result 222 states and 265 transitions. [2022-07-22 22:12:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 22:12:48,138 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2022-07-22 22:12:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:48,139 INFO L225 Difference]: With dead ends: 222 [2022-07-22 22:12:48,139 INFO L226 Difference]: Without dead ends: 188 [2022-07-22 22:12:48,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2022-07-22 22:12:48,140 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:48,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 747 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 110 Unchecked, 0.1s Time] [2022-07-22 22:12:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-22 22:12:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 181. [2022-07-22 22:12:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 141 states have (on average 1.148936170212766) internal successors, (162), 147 states have internal predecessors, (162), 21 states have call successors, (21), 12 states have call predecessors, (21), 18 states have return successors, (36), 21 states have call predecessors, (36), 20 states have call successors, (36) [2022-07-22 22:12:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 219 transitions. [2022-07-22 22:12:48,152 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 219 transitions. Word has length 64 [2022-07-22 22:12:48,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:48,153 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 219 transitions. [2022-07-22 22:12:48,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-22 22:12:48,153 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 219 transitions. [2022-07-22 22:12:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 22:12:48,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:48,154 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:48,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 22:12:48,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:12:48,371 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:48,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:48,372 INFO L85 PathProgramCache]: Analyzing trace with hash -418268106, now seen corresponding path program 1 times [2022-07-22 22:12:48,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:48,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083446212] [2022-07-22 22:12:48,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:48,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:48,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:48,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:48,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:12:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:48,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:12:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:12:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 22:12:48,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:48,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083446212] [2022-07-22 22:12:48,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083446212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:48,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:48,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 22:12:48,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185858390] [2022-07-22 22:12:48,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:48,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 22:12:48,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:48,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 22:12:48,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:12:48,715 INFO L87 Difference]: Start difference. First operand 181 states and 219 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-22 22:12:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:49,228 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2022-07-22 22:12:49,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:12:49,228 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2022-07-22 22:12:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:49,229 INFO L225 Difference]: With dead ends: 187 [2022-07-22 22:12:49,229 INFO L226 Difference]: Without dead ends: 185 [2022-07-22 22:12:49,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:12:49,230 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 49 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:49,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 165 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:12:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-22 22:12:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-07-22 22:12:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 144 states have (on average 1.1458333333333333) internal successors, (165), 150 states have internal predecessors, (165), 21 states have call successors, (21), 13 states have call predecessors, (21), 19 states have return successors, (36), 21 states have call predecessors, (36), 20 states have call successors, (36) [2022-07-22 22:12:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 222 transitions. [2022-07-22 22:12:49,243 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 222 transitions. Word has length 66 [2022-07-22 22:12:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:49,243 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 222 transitions. [2022-07-22 22:12:49,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-22 22:12:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 222 transitions. [2022-07-22 22:12:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 22:12:49,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:49,245 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:49,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 22:12:49,245 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:49,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1498102261, now seen corresponding path program 1 times [2022-07-22 22:12:49,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:49,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145907053] [2022-07-22 22:12:49,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:49,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:12:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:12:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 22:12:49,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:49,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145907053] [2022-07-22 22:12:49,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145907053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:49,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:49,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:12:49,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975492418] [2022-07-22 22:12:49,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:49,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:12:49,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:49,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:12:49,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:12:49,411 INFO L87 Difference]: Start difference. First operand 185 states and 222 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-22 22:12:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:49,629 INFO L93 Difference]: Finished difference Result 241 states and 284 transitions. [2022-07-22 22:12:49,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:12:49,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2022-07-22 22:12:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:49,630 INFO L225 Difference]: With dead ends: 241 [2022-07-22 22:12:49,630 INFO L226 Difference]: Without dead ends: 189 [2022-07-22 22:12:49,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:12:49,631 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 46 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:49,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 166 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:12:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-22 22:12:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 178. [2022-07-22 22:12:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 137 states have (on average 1.1313868613138687) internal successors, (155), 143 states have internal predecessors, (155), 21 states have call successors, (21), 13 states have call predecessors, (21), 19 states have return successors, (35), 21 states have call predecessors, (35), 20 states have call successors, (35) [2022-07-22 22:12:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 211 transitions. [2022-07-22 22:12:49,642 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 211 transitions. Word has length 66 [2022-07-22 22:12:49,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:49,642 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 211 transitions. [2022-07-22 22:12:49,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-22 22:12:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 211 transitions. [2022-07-22 22:12:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 22:12:49,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:49,645 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:49,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 22:12:49,645 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash 820275769, now seen corresponding path program 1 times [2022-07-22 22:12:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:49,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164159016] [2022-07-22 22:12:49,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:49,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:12:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:12:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 22:12:49,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:49,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164159016] [2022-07-22 22:12:49,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164159016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:49,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:49,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 22:12:49,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315849792] [2022-07-22 22:12:49,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:49,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 22:12:49,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:49,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 22:12:49,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:12:49,895 INFO L87 Difference]: Start difference. First operand 178 states and 211 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-22 22:12:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:50,314 INFO L93 Difference]: Finished difference Result 192 states and 225 transitions. [2022-07-22 22:12:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:12:50,314 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2022-07-22 22:12:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:50,315 INFO L225 Difference]: With dead ends: 192 [2022-07-22 22:12:50,316 INFO L226 Difference]: Without dead ends: 190 [2022-07-22 22:12:50,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-07-22 22:12:50,316 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 96 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:50,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 351 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:12:50,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-22 22:12:50,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2022-07-22 22:12:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 142 states have (on average 1.1267605633802817) internal successors, (160), 149 states have internal predecessors, (160), 21 states have call successors, (21), 13 states have call predecessors, (21), 20 states have return successors, (36), 21 states have call predecessors, (36), 20 states have call successors, (36) [2022-07-22 22:12:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 217 transitions. [2022-07-22 22:12:50,327 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 217 transitions. Word has length 66 [2022-07-22 22:12:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:50,327 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 217 transitions. [2022-07-22 22:12:50,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-22 22:12:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 217 transitions. [2022-07-22 22:12:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 22:12:50,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:50,329 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:50,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 22:12:50,329 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:50,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:50,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1521340347, now seen corresponding path program 1 times [2022-07-22 22:12:50,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:50,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248946265] [2022-07-22 22:12:50,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:50,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:50,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:50,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:50,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:50,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:50,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:50,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:12:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:50,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:12:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 22:12:50,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:50,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248946265] [2022-07-22 22:12:50,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248946265] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:12:50,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365714718] [2022-07-22 22:12:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:50,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:12:50,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:12:50,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:12:50,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 22:12:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:51,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 2520 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-22 22:12:51,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:12:51,392 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-07-22 22:12:51,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2022-07-22 22:12:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 22:12:52,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:12:52,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365714718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:52,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:12:52,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 26 [2022-07-22 22:12:52,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670110715] [2022-07-22 22:12:52,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:52,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:12:52,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:52,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:12:52,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-07-22 22:12:52,137 INFO L87 Difference]: Start difference. First operand 184 states and 217 transitions. Second operand has 14 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-22 22:12:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:52,222 INFO L93 Difference]: Finished difference Result 237 states and 272 transitions. [2022-07-22 22:12:52,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 22:12:52,223 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 66 [2022-07-22 22:12:52,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:52,225 INFO L225 Difference]: With dead ends: 237 [2022-07-22 22:12:52,225 INFO L226 Difference]: Without dead ends: 198 [2022-07-22 22:12:52,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2022-07-22 22:12:52,226 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 27 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:52,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 705 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 118 Unchecked, 0.1s Time] [2022-07-22 22:12:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-22 22:12:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 192. [2022-07-22 22:12:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 150 states have (on average 1.12) internal successors, (168), 157 states have internal predecessors, (168), 21 states have call successors, (21), 13 states have call predecessors, (21), 20 states have return successors, (34), 21 states have call predecessors, (34), 20 states have call successors, (34) [2022-07-22 22:12:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 223 transitions. [2022-07-22 22:12:52,238 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 223 transitions. Word has length 66 [2022-07-22 22:12:52,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:52,239 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 223 transitions. [2022-07-22 22:12:52,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-22 22:12:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 223 transitions. [2022-07-22 22:12:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-22 22:12:52,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:52,240 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:52,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 22:12:52,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-22 22:12:52,468 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:52,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:52,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1978442555, now seen corresponding path program 1 times [2022-07-22 22:12:52,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:52,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363179384] [2022-07-22 22:12:52,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:52,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:52,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:52,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:52,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:52,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:52,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:12:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:52,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:12:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 22:12:52,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:52,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363179384] [2022-07-22 22:12:52,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363179384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:52,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:52,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 22:12:52,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634000836] [2022-07-22 22:12:52,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:52,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:12:52,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:52,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:12:52,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:12:52,857 INFO L87 Difference]: Start difference. First operand 192 states and 223 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 22:12:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:53,515 INFO L93 Difference]: Finished difference Result 251 states and 293 transitions. [2022-07-22 22:12:53,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:12:53,516 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2022-07-22 22:12:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:53,517 INFO L225 Difference]: With dead ends: 251 [2022-07-22 22:12:53,517 INFO L226 Difference]: Without dead ends: 194 [2022-07-22 22:12:53,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-07-22 22:12:53,518 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 175 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:53,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 354 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 22:12:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-22 22:12:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 171. [2022-07-22 22:12:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 131 states have (on average 1.0916030534351144) internal successors, (143), 136 states have internal predecessors, (143), 21 states have call successors, (21), 13 states have call predecessors, (21), 18 states have return successors, (31), 21 states have call predecessors, (31), 20 states have call successors, (31) [2022-07-22 22:12:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 195 transitions. [2022-07-22 22:12:53,529 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 195 transitions. Word has length 70 [2022-07-22 22:12:53,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:53,530 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 195 transitions. [2022-07-22 22:12:53,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 22:12:53,530 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 195 transitions. [2022-07-22 22:12:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-22 22:12:53,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:53,531 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:53,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-22 22:12:53,532 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash 698578877, now seen corresponding path program 1 times [2022-07-22 22:12:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:53,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223938582] [2022-07-22 22:12:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:53,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:53,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:53,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:53,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:53,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:53,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:53,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:12:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:53,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:12:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 22:12:53,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:53,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223938582] [2022-07-22 22:12:53,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223938582] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:12:53,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202668329] [2022-07-22 22:12:53,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:53,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:12:53,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:12:53,866 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:12:53,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 22:12:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:54,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 2517 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 22:12:54,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:12:54,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:12:54,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:12:54,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:12:54,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-22 22:12:54,611 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 22:12:54,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-07-22 22:12:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 22:12:54,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:12:54,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202668329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:54,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:12:54,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-07-22 22:12:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456375920] [2022-07-22 22:12:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:54,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:12:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:54,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:12:54,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:12:54,621 INFO L87 Difference]: Start difference. First operand 171 states and 195 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-22 22:12:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:54,732 INFO L93 Difference]: Finished difference Result 272 states and 303 transitions. [2022-07-22 22:12:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:12:54,733 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2022-07-22 22:12:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:54,734 INFO L225 Difference]: With dead ends: 272 [2022-07-22 22:12:54,734 INFO L226 Difference]: Without dead ends: 177 [2022-07-22 22:12:54,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-07-22 22:12:54,735 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 18 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:54,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 432 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 56 Unchecked, 0.1s Time] [2022-07-22 22:12:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-22 22:12:54,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-07-22 22:12:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.0875912408759123) internal successors, (149), 142 states have internal predecessors, (149), 21 states have call successors, (21), 13 states have call predecessors, (21), 18 states have return successors, (30), 21 states have call predecessors, (30), 20 states have call successors, (30) [2022-07-22 22:12:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 200 transitions. [2022-07-22 22:12:54,745 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 200 transitions. Word has length 70 [2022-07-22 22:12:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:54,746 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 200 transitions. [2022-07-22 22:12:54,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-22 22:12:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 200 transitions. [2022-07-22 22:12:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-22 22:12:54,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:54,747 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:54,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-22 22:12:54,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:12:54,975 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:54,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash 304212091, now seen corresponding path program 1 times [2022-07-22 22:12:54,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:54,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682582105] [2022-07-22 22:12:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:54,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:55,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:55,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:55,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:55,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:55,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:55,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:12:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:55,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:12:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 22:12:55,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:55,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682582105] [2022-07-22 22:12:55,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682582105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:55,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:55,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 22:12:55,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843956038] [2022-07-22 22:12:55,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:55,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:12:55,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:55,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:12:55,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:12:55,527 INFO L87 Difference]: Start difference. First operand 177 states and 200 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-22 22:12:56,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:56,261 INFO L93 Difference]: Finished difference Result 238 states and 273 transitions. [2022-07-22 22:12:56,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:12:56,262 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2022-07-22 22:12:56,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:56,263 INFO L225 Difference]: With dead ends: 238 [2022-07-22 22:12:56,263 INFO L226 Difference]: Without dead ends: 205 [2022-07-22 22:12:56,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:12:56,264 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 154 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:56,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 362 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 22:12:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-22 22:12:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 182. [2022-07-22 22:12:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 141 states have (on average 1.0851063829787233) internal successors, (153), 147 states have internal predecessors, (153), 21 states have call successors, (21), 13 states have call predecessors, (21), 19 states have return successors, (31), 21 states have call predecessors, (31), 20 states have call successors, (31) [2022-07-22 22:12:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 205 transitions. [2022-07-22 22:12:56,276 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 205 transitions. Word has length 70 [2022-07-22 22:12:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:56,276 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 205 transitions. [2022-07-22 22:12:56,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-22 22:12:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 205 transitions. [2022-07-22 22:12:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-22 22:12:56,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:56,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:56,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-22 22:12:56,278 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:56,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1542301249, now seen corresponding path program 1 times [2022-07-22 22:12:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:56,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338217546] [2022-07-22 22:12:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:56,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:56,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:56,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:56,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:56,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:56,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:12:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:56,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:12:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 22:12:56,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:56,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338217546] [2022-07-22 22:12:56,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338217546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:12:56,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683184629] [2022-07-22 22:12:56,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:56,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:12:56,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:12:56,968 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:12:56,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 22:12:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:57,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-22 22:12:57,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:12:57,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:12:57,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:12:57,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:12:57,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-22 22:12:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 22:12:58,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:12:58,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683184629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:58,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:12:58,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [21] total 32 [2022-07-22 22:12:58,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385612771] [2022-07-22 22:12:58,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:58,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:12:58,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:58,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:12:58,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2022-07-22 22:12:58,358 INFO L87 Difference]: Start difference. First operand 182 states and 205 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-22 22:12:58,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:58,463 INFO L93 Difference]: Finished difference Result 219 states and 245 transitions. [2022-07-22 22:12:58,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 22:12:58,464 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 70 [2022-07-22 22:12:58,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:58,465 INFO L225 Difference]: With dead ends: 219 [2022-07-22 22:12:58,465 INFO L226 Difference]: Without dead ends: 181 [2022-07-22 22:12:58,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=962, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 22:12:58,466 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 6 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:58,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 816 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 161 Unchecked, 0.1s Time] [2022-07-22 22:12:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-22 22:12:58,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2022-07-22 22:12:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 137 states have internal predecessors, (143), 21 states have call successors, (21), 13 states have call predecessors, (21), 18 states have return successors, (29), 21 states have call predecessors, (29), 20 states have call successors, (29) [2022-07-22 22:12:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2022-07-22 22:12:58,479 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 70 [2022-07-22 22:12:58,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:58,479 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2022-07-22 22:12:58,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-22 22:12:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2022-07-22 22:12:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 22:12:58,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:58,481 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:58,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 22:12:58,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:12:58,695 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:58,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2083530690, now seen corresponding path program 1 times [2022-07-22 22:12:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:58,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636257737] [2022-07-22 22:12:58,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:58,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:12:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:58,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:12:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:58,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:12:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:59,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:12:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:59,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:12:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:59,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:12:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:12:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:59,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:12:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:59,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 22:12:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:12:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 22:12:59,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:12:59,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636257737] [2022-07-22 22:12:59,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636257737] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:12:59,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:12:59,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-22 22:12:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285388314] [2022-07-22 22:12:59,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:12:59,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 22:12:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:12:59,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 22:12:59,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:12:59,147 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-22 22:12:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:12:59,906 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2022-07-22 22:12:59,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 22:12:59,911 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 72 [2022-07-22 22:12:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:12:59,913 INFO L225 Difference]: With dead ends: 195 [2022-07-22 22:12:59,913 INFO L226 Difference]: Without dead ends: 193 [2022-07-22 22:12:59,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:12:59,914 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 53 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:12:59,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 22:12:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-22 22:12:59,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 182. [2022-07-22 22:12:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 137 states have (on average 1.0802919708029197) internal successors, (148), 142 states have internal predecessors, (148), 25 states have call successors, (25), 14 states have call predecessors, (25), 19 states have return successors, (33), 25 states have call predecessors, (33), 24 states have call successors, (33) [2022-07-22 22:12:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 206 transitions. [2022-07-22 22:12:59,930 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 206 transitions. Word has length 72 [2022-07-22 22:12:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:12:59,933 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 206 transitions. [2022-07-22 22:12:59,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-22 22:12:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 206 transitions. [2022-07-22 22:12:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-22 22:12:59,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:12:59,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:12:59,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-22 22:12:59,935 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:12:59,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:12:59,935 INFO L85 PathProgramCache]: Analyzing trace with hash 683060159, now seen corresponding path program 1 times [2022-07-22 22:12:59,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:12:59,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066356280] [2022-07-22 22:12:59,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:12:59,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:00,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:00,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:00,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:00,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:00,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:13:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:00,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:13:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:00,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:13:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 22:13:00,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:00,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066356280] [2022-07-22 22:13:00,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066356280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:00,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:00,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 22:13:00,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029083622] [2022-07-22 22:13:00,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:00,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:13:00,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:00,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:13:00,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:13:00,349 INFO L87 Difference]: Start difference. First operand 182 states and 206 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 22:13:01,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:01,210 INFO L93 Difference]: Finished difference Result 234 states and 264 transitions. [2022-07-22 22:13:01,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:13:01,210 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2022-07-22 22:13:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:01,211 INFO L225 Difference]: With dead ends: 234 [2022-07-22 22:13:01,211 INFO L226 Difference]: Without dead ends: 187 [2022-07-22 22:13:01,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-07-22 22:13:01,212 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 95 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:01,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 244 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 22:13:01,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-22 22:13:01,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2022-07-22 22:13:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 128 states have (on average 1.078125) internal successors, (138), 132 states have internal predecessors, (138), 25 states have call successors, (25), 14 states have call predecessors, (25), 18 states have return successors, (32), 25 states have call predecessors, (32), 24 states have call successors, (32) [2022-07-22 22:13:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 195 transitions. [2022-07-22 22:13:01,231 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 195 transitions. Word has length 70 [2022-07-22 22:13:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:01,232 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 195 transitions. [2022-07-22 22:13:01,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 22:13:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2022-07-22 22:13:01,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 22:13:01,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:01,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:01,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-22 22:13:01,234 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:01,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:01,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2084807610, now seen corresponding path program 1 times [2022-07-22 22:13:01,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:01,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596506367] [2022-07-22 22:13:01,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:01,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:01,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:01,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:01,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:13:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:01,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:13:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:01,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:13:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 22:13:01,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:01,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596506367] [2022-07-22 22:13:01,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596506367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:01,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:01,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-22 22:13:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111489737] [2022-07-22 22:13:01,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:01,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 22:13:01,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:01,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 22:13:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2022-07-22 22:13:01,934 INFO L87 Difference]: Start difference. First operand 172 states and 195 transitions. Second operand has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-22 22:13:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:03,159 INFO L93 Difference]: Finished difference Result 195 states and 220 transitions. [2022-07-22 22:13:03,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 22:13:03,160 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 72 [2022-07-22 22:13:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:03,161 INFO L225 Difference]: With dead ends: 195 [2022-07-22 22:13:03,161 INFO L226 Difference]: Without dead ends: 193 [2022-07-22 22:13:03,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2022-07-22 22:13:03,162 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 109 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:03,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 563 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1589 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-22 22:13:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-22 22:13:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 175. [2022-07-22 22:13:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 131 states have (on average 1.0763358778625953) internal successors, (141), 135 states have internal predecessors, (141), 24 states have call successors, (24), 15 states have call predecessors, (24), 19 states have return successors, (31), 24 states have call predecessors, (31), 23 states have call successors, (31) [2022-07-22 22:13:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2022-07-22 22:13:03,176 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 72 [2022-07-22 22:13:03,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:03,176 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2022-07-22 22:13:03,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-22 22:13:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2022-07-22 22:13:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 22:13:03,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:03,178 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:03,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-22 22:13:03,178 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:03,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:03,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1210932874, now seen corresponding path program 1 times [2022-07-22 22:13:03,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:03,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441902673] [2022-07-22 22:13:03,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:03,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:03,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:03,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:03,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:03,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:03,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:13:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:03,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:13:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:03,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:13:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 22:13:03,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:03,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441902673] [2022-07-22 22:13:03,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441902673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:03,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:03,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 22:13:03,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229386930] [2022-07-22 22:13:03,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:03,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 22:13:03,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:03,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 22:13:03,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:13:03,527 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 22:13:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:04,197 INFO L93 Difference]: Finished difference Result 224 states and 250 transitions. [2022-07-22 22:13:04,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:13:04,199 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2022-07-22 22:13:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:04,201 INFO L225 Difference]: With dead ends: 224 [2022-07-22 22:13:04,201 INFO L226 Difference]: Without dead ends: 187 [2022-07-22 22:13:04,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-07-22 22:13:04,202 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 64 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:04,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 216 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 22:13:04,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-22 22:13:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2022-07-22 22:13:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 131 states have (on average 1.0763358778625953) internal successors, (141), 135 states have internal predecessors, (141), 23 states have call successors, (23), 15 states have call predecessors, (23), 19 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2022-07-22 22:13:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions. [2022-07-22 22:13:04,216 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 72 [2022-07-22 22:13:04,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:04,216 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions. [2022-07-22 22:13:04,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 22:13:04,217 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions. [2022-07-22 22:13:04,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-22 22:13:04,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:04,218 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:04,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-22 22:13:04,218 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:04,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:04,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1862370124, now seen corresponding path program 1 times [2022-07-22 22:13:04,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:04,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840934060] [2022-07-22 22:13:04,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:04,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:04,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:04,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:04,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:04,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:04,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:13:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:04,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:04,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:13:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:04,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:13:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:04,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 22:13:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:04,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:13:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-22 22:13:04,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:04,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840934060] [2022-07-22 22:13:04,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840934060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:04,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:04,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 22:13:04,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330269548] [2022-07-22 22:13:04,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:04,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:13:04,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:04,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:13:04,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:13:04,481 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 22:13:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:04,860 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2022-07-22 22:13:04,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:13:04,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 78 [2022-07-22 22:13:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:04,862 INFO L225 Difference]: With dead ends: 180 [2022-07-22 22:13:04,862 INFO L226 Difference]: Without dead ends: 178 [2022-07-22 22:13:04,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:13:04,863 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 74 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:04,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 202 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:13:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-22 22:13:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-22 22:13:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 134 states have (on average 1.0746268656716418) internal successors, (144), 138 states have internal predecessors, (144), 23 states have call successors, (23), 16 states have call predecessors, (23), 20 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2022-07-22 22:13:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 196 transitions. [2022-07-22 22:13:04,878 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 196 transitions. Word has length 78 [2022-07-22 22:13:04,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:04,879 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 196 transitions. [2022-07-22 22:13:04,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 22:13:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 196 transitions. [2022-07-22 22:13:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-22 22:13:04,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:04,880 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:04,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-22 22:13:04,881 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:04,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1440681711, now seen corresponding path program 1 times [2022-07-22 22:13:04,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:04,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392339524] [2022-07-22 22:13:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:04,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:13:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:13:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:13:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:13:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 22:13:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:13:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 22:13:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-22 22:13:05,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:05,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392339524] [2022-07-22 22:13:05,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392339524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:05,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:05,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:13:05,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885574662] [2022-07-22 22:13:05,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:05,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:13:05,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:05,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:13:05,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:13:05,134 INFO L87 Difference]: Start difference. First operand 178 states and 196 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 22:13:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:05,506 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2022-07-22 22:13:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:13:05,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 85 [2022-07-22 22:13:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:05,508 INFO L225 Difference]: With dead ends: 202 [2022-07-22 22:13:05,509 INFO L226 Difference]: Without dead ends: 101 [2022-07-22 22:13:05,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:13:05,509 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 33 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:05,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 225 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:13:05,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-22 22:13:05,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-22 22:13:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.027027027027027) internal successors, (76), 75 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-07-22 22:13:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-07-22 22:13:05,518 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 85 [2022-07-22 22:13:05,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:05,518 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-07-22 22:13:05,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 22:13:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-07-22 22:13:05,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-22 22:13:05,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:05,519 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:05,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-22 22:13:05,520 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:05,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:05,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1866661214, now seen corresponding path program 1 times [2022-07-22 22:13:05,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:05,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303239565] [2022-07-22 22:13:05,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:05,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:13:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:13:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:13:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:13:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 22:13:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 22:13:05,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:05,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303239565] [2022-07-22 22:13:05,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303239565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:05,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:05,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-22 22:13:05,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568435699] [2022-07-22 22:13:05,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:05,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 22:13:05,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:05,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 22:13:05,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:13:05,924 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-22 22:13:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:06,485 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-07-22 22:13:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 22:13:06,486 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 84 [2022-07-22 22:13:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:06,486 INFO L225 Difference]: With dead ends: 142 [2022-07-22 22:13:06,487 INFO L226 Difference]: Without dead ends: 95 [2022-07-22 22:13:06,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-07-22 22:13:06,488 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 82 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:06,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 180 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:13:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-22 22:13:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-07-22 22:13:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-22 22:13:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-07-22 22:13:06,502 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 84 [2022-07-22 22:13:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:06,502 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-07-22 22:13:06,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-22 22:13:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-07-22 22:13:06,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-22 22:13:06,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:06,503 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:06,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-22 22:13:06,503 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash 61222880, now seen corresponding path program 1 times [2022-07-22 22:13:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:06,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6035803] [2022-07-22 22:13:06,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:06,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:13:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:13:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:13:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:13:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 22:13:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-22 22:13:06,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:06,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6035803] [2022-07-22 22:13:06,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6035803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:06,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:06,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-22 22:13:06,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937081797] [2022-07-22 22:13:06,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:06,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 22:13:06,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:06,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 22:13:06,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:13:06,942 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-22 22:13:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:07,471 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-07-22 22:13:07,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 22:13:07,471 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 84 [2022-07-22 22:13:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:07,472 INFO L225 Difference]: With dead ends: 90 [2022-07-22 22:13:07,472 INFO L226 Difference]: Without dead ends: 88 [2022-07-22 22:13:07,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:13:07,473 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 70 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:07,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 171 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:13:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-22 22:13:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-22 22:13:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 62 states have internal predecessors, (62), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-22 22:13:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2022-07-22 22:13:07,481 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 84 [2022-07-22 22:13:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:07,482 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2022-07-22 22:13:07,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-22 22:13:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2022-07-22 22:13:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-22 22:13:07,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:07,483 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:07,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-22 22:13:07,483 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:07,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2072795247, now seen corresponding path program 1 times [2022-07-22 22:13:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:07,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212781257] [2022-07-22 22:13:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:13:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:13:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:13:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:13:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 22:13:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 22:13:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 22:13:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-22 22:13:07,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:07,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212781257] [2022-07-22 22:13:07,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212781257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:07,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:07,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-22 22:13:07,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380195765] [2022-07-22 22:13:07,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:07,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 22:13:07,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:07,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 22:13:07,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-22 22:13:07,956 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-22 22:13:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:08,423 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-07-22 22:13:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 22:13:08,424 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 97 [2022-07-22 22:13:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:08,425 INFO L225 Difference]: With dead ends: 94 [2022-07-22 22:13:08,425 INFO L226 Difference]: Without dead ends: 90 [2022-07-22 22:13:08,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-07-22 22:13:08,425 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 78 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:08,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 183 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:13:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-22 22:13:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-22 22:13:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.0) internal successors, (63), 63 states have internal predecessors, (63), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-22 22:13:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2022-07-22 22:13:08,434 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 97 [2022-07-22 22:13:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:08,435 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2022-07-22 22:13:08,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-22 22:13:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2022-07-22 22:13:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-22 22:13:08,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:13:08,436 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:08,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-22 22:13:08,437 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:13:08,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:13:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash 654673100, now seen corresponding path program 1 times [2022-07-22 22:13:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:13:08,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466181513] [2022-07-22 22:13:08,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:13:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:13:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:13:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:13:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:13:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:13:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:13:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:13:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:13:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 22:13:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 22:13:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 22:13:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:13:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:13:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:13:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:13:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-22 22:13:09,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:13:09,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466181513] [2022-07-22 22:13:09,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466181513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:13:09,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:13:09,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-22 22:13:09,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181155223] [2022-07-22 22:13:09,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:13:09,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 22:13:09,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:13:09,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 22:13:09,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2022-07-22 22:13:09,852 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-22 22:13:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:13:10,490 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2022-07-22 22:13:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 22:13:10,490 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 114 [2022-07-22 22:13:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:13:10,491 INFO L225 Difference]: With dead ends: 90 [2022-07-22 22:13:10,491 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 22:13:10,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2022-07-22 22:13:10,492 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 42 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:13:10,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 197 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 22:13:10,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 22:13:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 22:13:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 22:13:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 22:13:10,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2022-07-22 22:13:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:13:10,493 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 22:13:10,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-22 22:13:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 22:13:10,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 22:13:10,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 22:13:10,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-22 22:13:10,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 22:13:12,891 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-22 22:13:12,891 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-22 22:13:12,891 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-22 22:13:12,892 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-22 22:13:12,892 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-22 22:13:12,892 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7375 7381) the Hoare annotation is: true [2022-07-22 22:13:12,892 INFO L899 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2022-07-22 22:13:12,892 INFO L899 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2022-07-22 22:13:12,892 INFO L899 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2022-07-22 22:13:12,892 INFO L899 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2022-07-22 22:13:12,892 INFO L899 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2022-07-22 22:13:12,892 INFO L899 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2022-07-22 22:13:12,892 INFO L899 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2022-07-22 22:13:12,892 INFO L899 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2022-07-22 22:13:12,892 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2022-07-22 22:13:12,892 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2022-07-22 22:13:12,892 INFO L899 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2022-07-22 22:13:12,892 INFO L899 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2022-07-22 22:13:12,893 INFO L899 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2022-07-22 22:13:12,893 INFO L899 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2022-07-22 22:13:12,893 INFO L899 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2022-07-22 22:13:12,893 INFO L899 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2022-07-22 22:13:12,893 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:13:12,893 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-22 22:13:12,893 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-22 22:13:12,893 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:13:12,893 INFO L895 garLoopResultBuilder]: At program point L8214(line 8214) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|))) (let ((.cse11 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse12 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8)) (.cse14 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse13 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse10 (select .cse15 |aws_byte_buf_from_array_~#buf~1.offset|))) (let ((.cse1 (= (select .cse15 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16)) .cse10)) (.cse3 (= (select .cse14 .cse13) 0)) (.cse2 (select .cse14 .cse12)) (.cse4 (= (select .cse11 .cse13) 0)) (.cse5 (= |aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse0 (select .cse11 .cse12)) (.cse6 (not (= |aws_byte_buf_from_array_~#buf~1.base| 0))) (.cse7 (= |aws_byte_buf_from_array_#in~len| .cse10)) (.cse8 (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|)) (.cse9 (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) (or (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= .cse0 0) .cse1 (= .cse2 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (mod aws_byte_buf_from_array_~len 18446744073709551616) 0)) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) .cse1 .cse3 (= .cse2 |aws_byte_buf_from_array_#in~bytes.offset|) .cse4 (< 0 (mod |aws_byte_buf_from_array_#in~len| 18446744073709551616)) .cse5 (= .cse0 |aws_byte_buf_from_array_#in~bytes.base|) .cse6 .cse7 .cse8 .cse9))))) [2022-07-22 22:13:12,893 INFO L899 garLoopResultBuilder]: For program point L8214-2(line 8214) no Hoare annotation was computed. [2022-07-22 22:13:12,893 INFO L895 garLoopResultBuilder]: At program point L8214-1(line 8214) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|))) (let ((.cse14 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse15 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8)) (.cse17 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse16 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse13 (select .cse18 |aws_byte_buf_from_array_~#buf~1.offset|))) (let ((.cse1 (= (select .cse18 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16)) .cse13)) (.cse3 (<= 1 |aws_byte_buf_from_array_#t~ret1053|)) (.cse4 (= (select .cse17 .cse16) 0)) (.cse2 (select .cse17 .cse15)) (.cse5 (= (select .cse14 .cse16) 0)) (.cse6 (<= |aws_byte_buf_from_array_#t~ret1053| 1)) (.cse7 (= |aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse0 (select .cse14 .cse15)) (.cse8 (not (= |aws_byte_buf_from_array_~#buf~1.base| 0))) (.cse9 (not (= aws_byte_buf_from_array_~bytes.base 0))) (.cse10 (= |aws_byte_buf_from_array_#in~len| .cse13)) (.cse11 (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|)) (.cse12 (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) (or (and (= .cse0 0) .cse1 (= .cse2 0) .cse3 .cse4 (<= 0 (+ |aws_byte_buf_from_array_#in~len| (* (div (* (- 1) |aws_byte_buf_from_array_#in~len|) 18446744073709551616) 18446744073709551616))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) .cse1 .cse3 .cse4 (= .cse2 |aws_byte_buf_from_array_#in~bytes.offset|) .cse5 .cse6 (< 0 (mod |aws_byte_buf_from_array_#in~len| 18446744073709551616)) .cse7 (= .cse0 |aws_byte_buf_from_array_#in~bytes.base|) .cse8 .cse9 .cse10 .cse11 .cse12) (= |aws_byte_buf_from_array_#in~bytes.base| 0))))) [2022-07-22 22:13:12,893 INFO L899 garLoopResultBuilder]: For program point L8206(lines 8206 8207) no Hoare annotation was computed. [2022-07-22 22:13:12,893 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayFINAL(lines 8203 8216) no Hoare annotation was computed. [2022-07-22 22:13:12,893 INFO L899 garLoopResultBuilder]: For program point L8204-1(line 8204) no Hoare annotation was computed. [2022-07-22 22:13:12,894 INFO L895 garLoopResultBuilder]: At program point L8204(line 8204) the Hoare annotation is: (or (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|) (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) [2022-07-22 22:13:12,894 INFO L899 garLoopResultBuilder]: For program point L8206-2(lines 8206 8207) no Hoare annotation was computed. [2022-07-22 22:13:12,894 INFO L895 garLoopResultBuilder]: At program point aws_byte_buf_from_arrayENTRY(lines 8203 8216) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (= |aws_byte_buf_from_array_#in~bytes.base| 0)) [2022-07-22 22:13:12,894 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayEXIT(lines 8203 8216) no Hoare annotation was computed. [2022-07-22 22:13:12,894 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-22 22:13:12,894 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-22 22:13:12,894 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-22 22:13:12,894 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 22:13:12,894 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-22 22:13:12,894 INFO L899 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2022-07-22 22:13:12,894 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-22 22:13:12,894 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select .cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse4)) (= (select .cse2 .cse4) 0) (= (select .cse3 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-07-22 22:13:12,894 INFO L895 garLoopResultBuilder]: At program point L8971(lines 8971 8973) the Hoare annotation is: (let ((.cse10 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse13 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse14 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse13 .cse14) 0)) (.cse2 (= (select .cse11 .cse14) 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse7 (select .cse13 .cse12)) (.cse4 (= (select .cse11 .cse12) 0)) (.cse5 (= (select .cse10 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1214#1.base| 0)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1214#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select .cse10 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse7) .cse4 .cse5 .cse6 .cse8 .cse9 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|))))) [2022-07-22 22:13:12,894 INFO L899 garLoopResultBuilder]: For program point L8971-1(lines 8971 8973) no Hoare annotation was computed. [2022-07-22 22:13:12,895 INFO L895 garLoopResultBuilder]: At program point L8965(line 8965) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) [2022-07-22 22:13:12,895 INFO L899 garLoopResultBuilder]: For program point L8965-1(line 8965) no Hoare annotation was computed. [2022-07-22 22:13:12,895 INFO L895 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse14 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse10 (select .cse14 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse13 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse15 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse11 .cse15) 0)) (.cse2 (= (select .cse13 .cse15) 0)) (.cse3 (= (select .cse14 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse6 (= (select .cse13 .cse12) 0)) (.cse7 (= .cse10 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse5 (select .cse11 .cse12)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1212#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse5) .cse6 .cse7 .cse8 .cse9 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (<= .cse10 (* (div .cse10 18446744073709551616) 18446744073709551616)) (= .cse5 0) .cse9))))) [2022-07-22 22:13:12,895 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-22 22:13:12,895 INFO L899 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2022-07-22 22:13:12,895 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select .cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse4)) (= (select .cse2 .cse4) 0) (= (select .cse3 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-07-22 22:13:12,895 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 22:13:12,895 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 22:13:12,895 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 22:13:12,895 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-22 22:13:12,895 INFO L899 garLoopResultBuilder]: For program point L8959(lines 8959 8977) no Hoare annotation was computed. [2022-07-22 22:13:12,895 INFO L902 garLoopResultBuilder]: At program point L8978(line 8978) the Hoare annotation is: true [2022-07-22 22:13:12,895 INFO L899 garLoopResultBuilder]: For program point L8974-2(lines 8974 8976) no Hoare annotation was computed. [2022-07-22 22:13:12,895 INFO L895 garLoopResultBuilder]: At program point L8970(line 8970) the Hoare annotation is: (let ((.cse14 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse10 (select .cse14 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse13 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse15 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse11 .cse15) 0)) (.cse2 (= (select .cse13 .cse15) 0)) (.cse3 (= (select .cse14 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse6 (= (select .cse13 .cse12) 0)) (.cse7 (= .cse10 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1213#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse5 (select .cse11 .cse12))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse5) .cse6 .cse7 .cse8 .cse9 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (<= .cse10 (* (div .cse10 18446744073709551616) 18446744073709551616)) (= .cse5 0)))))) [2022-07-22 22:13:12,897 INFO L899 garLoopResultBuilder]: For program point L8974(lines 8974 8976) no Hoare annotation was computed. [2022-07-22 22:13:12,897 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select .cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse4)) (= (select .cse2 .cse4) 0) (= (select .cse3 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_#t~mem589#1| |ULTIMATE.start_assert_bytes_match_#t~mem588#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-07-22 22:13:12,897 INFO L902 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: true [2022-07-22 22:13:12,897 INFO L899 garLoopResultBuilder]: For program point L8970-1(line 8970) no Hoare annotation was computed. [2022-07-22 22:13:12,898 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select .cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse4)) (= (select .cse2 .cse4) 0) (= (select .cse3 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-07-22 22:13:12,898 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse12 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse14 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse11 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse5 (select .cse14 .cse11)) (.cse9 (select .cse12 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse10 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse13 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select .cse14 .cse13) 0)) (.cse1 (= (select .cse10 .cse13) 0)) (.cse3 (= (select .cse12 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse6 (= (select .cse10 .cse11) 0)) (.cse7 (= .cse9 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse2 (= .cse5 0))) (or (and .cse0 .cse1 (not .cse2) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse5) .cse6 .cse7 .cse8 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 (<= .cse9 (* (div .cse9 18446744073709551616) 18446744073709551616)) .cse2))))) [2022-07-22 22:13:12,898 INFO L895 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse17 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse15 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1211#1| 1)) (.cse2 (= (select .cse15 .cse19) 0)) (.cse3 (= (select .cse18 .cse19) 0)) (.cse4 (= (select .cse17 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse7 (= (select .cse18 .cse16) 0)) (.cse9 (<= 1 |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1211#1|)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse8 (select .cse17 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse6 (select .cse15 .cse16))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse4 .cse5 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse6) .cse7 (= .cse8 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse9 .cse10 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (and .cse0 .cse1 .cse2 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_13| Int)) (let ((.cse14 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_13|))) (let ((.cse12 (select .cse14 16)) (.cse11 (select .cse14 0)) (.cse13 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (= .cse11 .cse12) (= (select .cse13 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) .cse12) (= .cse11 (select .cse13 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)))))) .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 (<= .cse8 (* (div .cse8 18446744073709551616) 18446744073709551616)) (= .cse6 0))))) [2022-07-22 22:13:12,898 INFO L899 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2022-07-22 22:13:12,898 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-22 22:13:12,898 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-22 22:13:12,898 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-22 22:13:12,898 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-22 22:13:12,898 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:13:12,898 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:13:12,898 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-22 22:13:12,901 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:13:12,903 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 22:13:12,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 10:13:12 BoogieIcfgContainer [2022-07-22 22:13:12,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 22:13:12,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 22:13:12,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 22:13:12,911 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 22:13:12,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:12:28" (3/4) ... [2022-07-22 22:13:12,915 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 22:13:12,921 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-22 22:13:12,921 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_from_array [2022-07-22 22:13:12,921 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-22 22:13:12,921 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-07-22 22:13:12,922 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-22 22:13:12,922 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-22 22:13:12,945 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 122 nodes and edges [2022-07-22 22:13:12,952 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2022-07-22 22:13:12,953 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-22 22:13:12,954 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-07-22 22:13:12,955 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-22 22:13:12,956 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-22 22:13:12,957 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 22:13:12,958 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 22:13:13,639 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 22:13:13,639 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 22:13:13,640 INFO L158 Benchmark]: Toolchain (without parser) took 49050.28ms. Allocated memory was 86.0MB in the beginning and 522.2MB in the end (delta: 436.2MB). Free memory was 42.2MB in the beginning and 281.7MB in the end (delta: -239.5MB). Peak memory consumption was 198.4MB. Max. memory is 16.1GB. [2022-07-22 22:13:13,640 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 86.0MB. Free memory was 56.2MB in the beginning and 56.2MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 22:13:13,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2118.84ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 42.0MB in the beginning and 55.6MB in the end (delta: -13.6MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2022-07-22 22:13:13,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 161.54ms. Allocated memory is still 125.8MB. Free memory was 55.6MB in the beginning and 44.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 22:13:13,641 INFO L158 Benchmark]: Boogie Preprocessor took 103.67ms. Allocated memory is still 125.8MB. Free memory was 44.5MB in the beginning and 69.8MB in the end (delta: -25.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 22:13:13,641 INFO L158 Benchmark]: RCFGBuilder took 1234.26ms. Allocated memory was 125.8MB in the beginning and 180.4MB in the end (delta: 54.5MB). Free memory was 69.8MB in the beginning and 79.5MB in the end (delta: -9.7MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2022-07-22 22:13:13,641 INFO L158 Benchmark]: TraceAbstraction took 44697.22ms. Allocated memory was 180.4MB in the beginning and 522.2MB in the end (delta: 341.8MB). Free memory was 78.5MB in the beginning and 412.8MB in the end (delta: -334.3MB). Peak memory consumption was 272.9MB. Max. memory is 16.1GB. [2022-07-22 22:13:13,641 INFO L158 Benchmark]: Witness Printer took 728.60ms. Allocated memory is still 522.2MB. Free memory was 412.8MB in the beginning and 281.7MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-07-22 22:13:13,642 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.56ms. Allocated memory is still 86.0MB. Free memory was 56.2MB in the beginning and 56.2MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2118.84ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 42.0MB in the beginning and 55.6MB in the end (delta: -13.6MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 161.54ms. Allocated memory is still 125.8MB. Free memory was 55.6MB in the beginning and 44.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.67ms. Allocated memory is still 125.8MB. Free memory was 44.5MB in the beginning and 69.8MB in the end (delta: -25.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1234.26ms. Allocated memory was 125.8MB in the beginning and 180.4MB in the end (delta: 54.5MB). Free memory was 69.8MB in the beginning and 79.5MB in the end (delta: -9.7MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * TraceAbstraction took 44697.22ms. Allocated memory was 180.4MB in the beginning and 522.2MB in the end (delta: 341.8MB). Free memory was 78.5MB in the beginning and 412.8MB in the end (delta: -334.3MB). Peak memory consumption was 272.9MB. Max. memory is 16.1GB. * Witness Printer took 728.60ms. Allocated memory is still 522.2MB. Free memory was 412.8MB in the beginning and 281.7MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * 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 7 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.6s, OverallIterations: 37, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2975 SdHoareTripleChecker+Valid, 12.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2782 mSDsluCounter, 11875 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 738 IncrementalHoareTripleChecker+Unchecked, 9168 mSDsCounter, 936 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15455 IncrementalHoareTripleChecker+Invalid, 17129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 936 mSolverCounterUnsat, 2707 mSDtfsCounter, 15455 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1528 GetRequests, 908 SyntacticMatches, 13 SemanticMatches, 607 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=23, InterpolantAutomatonStates: 419, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 37 MinimizatonAttempts, 358 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 271 PreInvPairs, 293 NumberOfFragments, 1601 HoareAnnotationTreeSize, 271 FomulaSimplifications, 4980 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 47276 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 6.6s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 2704 NumberOfCodeBlocks, 2704 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2660 ConstructedInterpolants, 176 QuantifiedInterpolants, 15945 SizeOfPredicates, 74 NumberOfNonLiveVariables, 17487 ConjunctsInSsa, 229 ConjunctsInUnsatCore, 44 InterpolantComputations, 37 PerfectInterpolantSequences, 823/870 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: 8978]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-22 22:13:13,675 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