./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_put_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 7e3410638a547f2efce35a13c7d23c64ee660b1c493ec273ce9d4043edc218c3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:11:48,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:11:48,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:11:48,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:11:48,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:11:48,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:11:48,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:11:48,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:11:48,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:11:48,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:11:48,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:11:48,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:11:48,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:11:48,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:11:48,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:11:48,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:11:48,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:11:48,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:11:48,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:11:48,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:11:48,395 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:11:48,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:11:48,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:11:48,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:11:48,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:11:48,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:11:48,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:11:48,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:11:48,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:11:48,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:11:48,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:11:48,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:11:48,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:11:48,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:11:48,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:11:48,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:11:48,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:11:48,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:11:48,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:11:48,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:11:48,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:11:48,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:11:48,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:11:48,443 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:11:48,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:11:48,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:11:48,445 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:11:48,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:11:48,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:11:48,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:11:48,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:11:48,446 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:11:48,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:11:48,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:11:48,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:11:48,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:11:48,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:11:48,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:11:48,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:11:48,448 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:11:48,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:11:48,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:11:48,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:11:48,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:11:48,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:11:48,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:11:48,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:11:48,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:11:48,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:11:48,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:11:48,449 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:11:48,450 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:11:48,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:11:48,450 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 -> 7e3410638a547f2efce35a13c7d23c64ee660b1c493ec273ce9d4043edc218c3 [2022-07-19 22:11:48,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:11:48,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:11:48,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:11:48,639 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:11:48,639 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:11:48,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i [2022-07-19 22:11:48,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530a8beb4/b746bf8e0a6441d580433d5b9a6440b1/FLAG588c6c769 [2022-07-19 22:11:49,237 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:11:49,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i [2022-07-19 22:11:49,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530a8beb4/b746bf8e0a6441d580433d5b9a6440b1/FLAG588c6c769 [2022-07-19 22:11:49,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530a8beb4/b746bf8e0a6441d580433d5b9a6440b1 [2022-07-19 22:11:49,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:11:49,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:11:49,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:11:49,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:11:49,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:11:49,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:11:49" (1/1) ... [2022-07-19 22:11:49,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13586184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:11:49, skipping insertion in model container [2022-07-19 22:11:49,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:11:49" (1/1) ... [2022-07-19 22:11:49,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:11:49,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:11:50,000 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_hash_table_put_harness.i[4492,4505] [2022-07-19 22:11:50,008 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_hash_table_put_harness.i[4552,4565] [2022-07-19 22:11:50,614 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:50,621 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:50,621 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:50,622 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:50,624 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:50,631 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:50,647 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:50,650 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:50,651 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:50,652 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:50,653 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:50,653 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:50,653 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:50,888 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:11:50,888 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:11:50,889 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:11:50,890 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:11:50,891 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:11:50,891 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:11:50,891 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:11:50,892 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:11:50,892 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:11:50,893 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:11:51,063 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:11:51,278 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,279 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,296 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,297 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,301 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,301 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,315 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,316 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,317 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,318 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,318 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,318 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,319 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:11:51,381 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:11:51,401 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_hash_table_put_harness.i[4492,4505] [2022-07-19 22:11:51,402 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_hash_table_put_harness.i[4552,4565] [2022-07-19 22:11:51,426 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,427 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,427 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,427 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,428 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,436 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,437 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,437 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,438 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,455 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,456 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,456 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,457 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,508 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:11:51,509 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:11:51,509 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:11:51,510 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:11:51,511 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:11:51,511 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:11:51,513 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:11:51,513 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:11:51,513 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:11:51,514 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:11:51,531 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:11:51,587 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,588 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,593 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,593 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,595 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,595 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,604 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,604 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,605 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,605 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,606 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,606 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,606 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:11:51,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:11:51,798 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:11:51,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:11:51 WrapperNode [2022-07-19 22:11:51,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:11:51,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:11:51,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:11:51,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:11:51,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:11:51" (1/1) ... [2022-07-19 22:11:51,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:11:51" (1/1) ... [2022-07-19 22:11:51,983 INFO L137 Inliner]: procedures = 775, calls = 2489, calls flagged for inlining = 70, calls inlined = 25, statements flattened = 1393 [2022-07-19 22:11:51,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:11:51,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:11:51,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:11:51,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:11:51,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:11:51" (1/1) ... [2022-07-19 22:11:51,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:11:51" (1/1) ... [2022-07-19 22:11:52,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:11:51" (1/1) ... [2022-07-19 22:11:52,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:11:51" (1/1) ... [2022-07-19 22:11:52,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:11:51" (1/1) ... [2022-07-19 22:11:52,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:11:51" (1/1) ... [2022-07-19 22:11:52,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:11:51" (1/1) ... [2022-07-19 22:11:52,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:11:52,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:11:52,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:11:52,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:11:52,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:11:51" (1/1) ... [2022-07-19 22:11:52,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:11:52,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:11:52,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 22:11:52,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 22:11:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-19 22:11:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 22:11:52,223 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 22:11:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:11:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-19 22:11:52,224 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-19 22:11:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 22:11:52,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 22:11:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-19 22:11:52,224 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-19 22:11:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:11:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:11:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:11:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2022-07-19 22:11:52,225 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2022-07-19 22:11:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:11:52,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:11:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 22:11:52,225 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 22:11:52,226 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-19 22:11:52,226 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-19 22:11:52,226 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2022-07-19 22:11:52,226 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2022-07-19 22:11:52,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:11:52,226 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-19 22:11:52,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-19 22:11:52,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:11:52,227 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 22:11:52,227 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 22:11:52,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:11:52,227 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2022-07-19 22:11:52,227 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2022-07-19 22:11:52,227 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-19 22:11:52,227 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-19 22:11:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2022-07-19 22:11:52,228 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2022-07-19 22:11:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2022-07-19 22:11:52,228 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2022-07-19 22:11:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2022-07-19 22:11:52,228 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2022-07-19 22:11:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:11:52,229 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-19 22:11:52,229 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-19 22:11:52,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-19 22:11:52,231 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2022-07-19 22:11:52,231 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2022-07-19 22:11:52,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-19 22:11:52,232 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-19 22:11:52,233 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-19 22:11:52,233 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-19 22:11:52,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-19 22:11:52,233 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2022-07-19 22:11:52,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2022-07-19 22:11:52,237 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2022-07-19 22:11:52,238 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2022-07-19 22:11:52,238 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2022-07-19 22:11:52,238 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2022-07-19 22:11:52,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 22:11:52,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 22:11:52,238 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-19 22:11:52,238 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-19 22:11:52,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:11:52,238 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-19 22:11:52,239 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-19 22:11:52,239 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-19 22:11:52,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-19 22:11:52,239 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-19 22:11:52,239 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-19 22:11:52,239 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2022-07-19 22:11:52,239 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2022-07-19 22:11:52,239 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-19 22:11:52,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-19 22:11:52,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:11:52,525 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:11:52,527 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:11:52,681 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume !true; [2022-07-19 22:11:52,704 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !true; [2022-07-19 22:11:53,081 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume !true; [2022-07-19 22:11:53,081 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !true; [2022-07-19 22:11:53,532 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:11:53,546 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:11:53,546 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-19 22:11:53,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:11:53 BoogieIcfgContainer [2022-07-19 22:11:53,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:11:53,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:11:53,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:11:53,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:11:53,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:11:49" (1/3) ... [2022-07-19 22:11:53,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0f41f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:11:53, skipping insertion in model container [2022-07-19 22:11:53,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:11:51" (2/3) ... [2022-07-19 22:11:53,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0f41f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:11:53, skipping insertion in model container [2022-07-19 22:11:53,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:11:53" (3/3) ... [2022-07-19 22:11:53,569 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_put_harness.i [2022-07-19 22:11:53,585 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:11:53,585 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:11:53,659 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:11:53,667 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@1ea0f0e8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6104b60a [2022-07-19 22:11:53,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:11:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 361 states, 248 states have (on average 1.282258064516129) internal successors, (318), 245 states have internal predecessors, (318), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2022-07-19 22:11:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 22:11:53,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:11:53,690 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:11:53,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:11:53,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:11:53,696 INFO L85 PathProgramCache]: Analyzing trace with hash 200610363, now seen corresponding path program 1 times [2022-07-19 22:11:53,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:11:53,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582924076] [2022-07-19 22:11:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:11:53,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:11:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:54,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:11:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:54,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:11:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:54,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:11:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:54,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:11:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:54,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:11:54,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:11:54,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582924076] [2022-07-19 22:11:54,248 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-19 22:11:54,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469424816] [2022-07-19 22:11:54,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:11:54,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:11:54,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:11:54,250 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:11:54,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 22:11:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:54,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 2859 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 22:11:54,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:11:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-19 22:11:54,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:11:54,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469424816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:11:54,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:11:54,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 22:11:54,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793029974] [2022-07-19 22:11:54,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:11:54,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 22:11:54,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:11:54,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 22:11:54,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:11:54,838 INFO L87 Difference]: Start difference. First operand has 361 states, 248 states have (on average 1.282258064516129) internal successors, (318), 245 states have internal predecessors, (318), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:11:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:11:54,902 INFO L93 Difference]: Finished difference Result 716 states and 1017 transitions. [2022-07-19 22:11:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 22:11:54,904 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2022-07-19 22:11:54,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:11:54,915 INFO L225 Difference]: With dead ends: 716 [2022-07-19 22:11:54,915 INFO L226 Difference]: Without dead ends: 355 [2022-07-19 22:11:54,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:11:54,923 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:11:54,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:11:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-07-19 22:11:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2022-07-19 22:11:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 239 states have (on average 1.2677824267782427) internal successors, (303), 240 states have internal predecessors, (303), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-19 22:11:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 474 transitions. [2022-07-19 22:11:54,976 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 474 transitions. Word has length 136 [2022-07-19 22:11:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:11:54,978 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 474 transitions. [2022-07-19 22:11:54,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:11:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 474 transitions. [2022-07-19 22:11:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 22:11:54,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:11:54,981 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:11:55,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 22:11:55,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-19 22:11:55,197 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:11:55,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:11:55,197 INFO L85 PathProgramCache]: Analyzing trace with hash 810580097, now seen corresponding path program 1 times [2022-07-19 22:11:55,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:11:55,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294440757] [2022-07-19 22:11:55,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:11:55,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:11:55,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 22:11:55,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1289844640] [2022-07-19 22:11:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:11:55,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:11:55,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:11:55,355 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:11:55,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 22:11:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:55,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 2859 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 22:11:55,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:11:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-19 22:11:56,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:11:56,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:11:56,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294440757] [2022-07-19 22:11:56,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 22:11:56,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289844640] [2022-07-19 22:11:56,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289844640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:11:56,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:11:56,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:11:56,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090823616] [2022-07-19 22:11:56,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:11:56,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:11:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:11:56,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:11:56,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:11:56,108 INFO L87 Difference]: Start difference. First operand 355 states and 474 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:11:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:11:56,561 INFO L93 Difference]: Finished difference Result 727 states and 982 transitions. [2022-07-19 22:11:56,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:11:56,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2022-07-19 22:11:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:11:56,565 INFO L225 Difference]: With dead ends: 727 [2022-07-19 22:11:56,565 INFO L226 Difference]: Without dead ends: 419 [2022-07-19 22:11:56,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:11:56,567 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 632 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:11:56,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1757 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 22:11:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-07-19 22:11:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 357. [2022-07-19 22:11:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 241 states have (on average 1.2655601659751037) internal successors, (305), 242 states have internal predecessors, (305), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-19 22:11:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 476 transitions. [2022-07-19 22:11:56,589 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 476 transitions. Word has length 136 [2022-07-19 22:11:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:11:56,589 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 476 transitions. [2022-07-19 22:11:56,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:11:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 476 transitions. [2022-07-19 22:11:56,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 22:11:56,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:11:56,592 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:11:56,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 22:11:56,814 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,SelfDestructingSolverStorable1 [2022-07-19 22:11:56,814 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:11:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:11:56,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1233281923, now seen corresponding path program 1 times [2022-07-19 22:11:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:11:56,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291523932] [2022-07-19 22:11:56,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:11:56,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:11:56,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 22:11:56,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426577216] [2022-07-19 22:11:56,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:11:56,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:11:56,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:11:56,896 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:11:56,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 22:11:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:57,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 2852 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 22:11:57,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:11:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-19 22:11:57,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:11:57,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:11:57,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291523932] [2022-07-19 22:11:57,571 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 22:11:57,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426577216] [2022-07-19 22:11:57,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426577216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:11:57,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:11:57,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:11:57,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199124377] [2022-07-19 22:11:57,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:11:57,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:11:57,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:11:57,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:11:57,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:11:57,573 INFO L87 Difference]: Start difference. First operand 357 states and 476 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:11:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:11:57,610 INFO L93 Difference]: Finished difference Result 710 states and 950 transitions. [2022-07-19 22:11:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:11:57,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2022-07-19 22:11:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:11:57,613 INFO L225 Difference]: With dead ends: 710 [2022-07-19 22:11:57,613 INFO L226 Difference]: Without dead ends: 362 [2022-07-19 22:11:57,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:11:57,614 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 2 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:11:57,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1876 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:11:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-19 22:11:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2022-07-19 22:11:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 245 states have (on average 1.2612244897959184) internal successors, (309), 246 states have internal predecessors, (309), 86 states have call successors, (86), 29 states have call predecessors, (86), 30 states have return successors, (89), 86 states have call predecessors, (89), 85 states have call successors, (89) [2022-07-19 22:11:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 484 transitions. [2022-07-19 22:11:57,630 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 484 transitions. Word has length 136 [2022-07-19 22:11:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:11:57,630 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 484 transitions. [2022-07-19 22:11:57,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:11:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 484 transitions. [2022-07-19 22:11:57,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-19 22:11:57,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:11:57,649 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:11:57,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 22:11:57,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:11:57,871 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:11:57,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:11:57,872 INFO L85 PathProgramCache]: Analyzing trace with hash 292227623, now seen corresponding path program 1 times [2022-07-19 22:11:57,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:11:57,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829675788] [2022-07-19 22:11:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:11:57,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:11:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:11:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:11:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:11:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:11:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:11:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:11:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:11:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:11:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:11:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:11:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:11:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:11:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:11:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:11:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:11:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:11:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:11:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:11:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:11:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:11:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 22:11:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 22:11:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:11:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-19 22:11:58,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:11:58,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829675788] [2022-07-19 22:11:58,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829675788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:11:58,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:11:58,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 22:11:58,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634724611] [2022-07-19 22:11:58,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:11:58,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 22:11:58,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:11:58,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 22:11:58,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:11:58,486 INFO L87 Difference]: Start difference. First operand 362 states and 484 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 9 states have internal predecessors, (68), 4 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-19 22:12:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:01,899 INFO L93 Difference]: Finished difference Result 761 states and 1022 transitions. [2022-07-19 22:12:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 22:12:01,900 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 9 states have internal predecessors, (68), 4 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 142 [2022-07-19 22:12:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:01,902 INFO L225 Difference]: With dead ends: 761 [2022-07-19 22:12:01,902 INFO L226 Difference]: Without dead ends: 420 [2022-07-19 22:12:01,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:12:01,904 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 319 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:01,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 2116 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2596 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-19 22:12:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-07-19 22:12:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 367. [2022-07-19 22:12:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 249 states have (on average 1.2610441767068272) internal successors, (314), 251 states have internal predecessors, (314), 86 states have call successors, (86), 29 states have call predecessors, (86), 31 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2022-07-19 22:12:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 490 transitions. [2022-07-19 22:12:01,929 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 490 transitions. Word has length 142 [2022-07-19 22:12:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:01,929 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 490 transitions. [2022-07-19 22:12:01,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 9 states have internal predecessors, (68), 4 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-19 22:12:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 490 transitions. [2022-07-19 22:12:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-19 22:12:01,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:01,932 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:01,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:12:01,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:01,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 319293225, now seen corresponding path program 1 times [2022-07-19 22:12:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:01,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307880069] [2022-07-19 22:12:01,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:01,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:12:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:12:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:12:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:12:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:12:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 22:12:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 22:12:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-19 22:12:02,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:02,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307880069] [2022-07-19 22:12:02,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307880069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:02,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:02,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:12:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198955050] [2022-07-19 22:12:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:02,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:12:02,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:02,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:12:02,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:12:02,300 INFO L87 Difference]: Start difference. First operand 367 states and 490 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-19 22:12:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:03,782 INFO L93 Difference]: Finished difference Result 768 states and 1030 transitions. [2022-07-19 22:12:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:12:03,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 142 [2022-07-19 22:12:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:03,785 INFO L225 Difference]: With dead ends: 768 [2022-07-19 22:12:03,786 INFO L226 Difference]: Without dead ends: 415 [2022-07-19 22:12:03,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:12:03,787 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 523 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:03,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1275 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 22:12:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-19 22:12:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 365. [2022-07-19 22:12:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 247 states have (on average 1.2550607287449393) internal successors, (310), 249 states have internal predecessors, (310), 86 states have call successors, (86), 29 states have call predecessors, (86), 31 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2022-07-19 22:12:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 486 transitions. [2022-07-19 22:12:03,818 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 486 transitions. Word has length 142 [2022-07-19 22:12:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:03,819 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 486 transitions. [2022-07-19 22:12:03,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-19 22:12:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 486 transitions. [2022-07-19 22:12:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-19 22:12:03,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:03,825 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:03,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 22:12:03,825 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:03,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:03,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1626460037, now seen corresponding path program 1 times [2022-07-19 22:12:03,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:03,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409057135] [2022-07-19 22:12:03,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:03,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:03,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:03,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:03,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:03,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:03,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:03,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:12:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:12:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:12:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 22:12:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 22:12:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:12:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 22:12:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 22:12:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-19 22:12:04,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:04,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409057135] [2022-07-19 22:12:04,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409057135] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:12:04,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049617254] [2022-07-19 22:12:04,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:04,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:12:04,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:12:04,161 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-19 22:12:04,162 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-19 22:12:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:04,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 2880 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 22:12:04,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:12:05,786 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2022-07-19 22:12:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-19 22:12:13,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:12:13,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049617254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:13,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:12:13,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-07-19 22:12:13,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862533633] [2022-07-19 22:12:13,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:13,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:12:13,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:13,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:12:13,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2022-07-19 22:12:13,764 INFO L87 Difference]: Start difference. First operand 365 states and 486 transitions. Second operand has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-19 22:12:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:14,276 INFO L93 Difference]: Finished difference Result 713 states and 950 transitions. [2022-07-19 22:12:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:12:14,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 148 [2022-07-19 22:12:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:14,283 INFO L225 Difference]: With dead ends: 713 [2022-07-19 22:12:14,283 INFO L226 Difference]: Without dead ends: 367 [2022-07-19 22:12:14,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=51, Invalid=222, Unknown=3, NotChecked=30, Total=306 [2022-07-19 22:12:14,285 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 5 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2504 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 676 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:14,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2504 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 676 Unchecked, 0.4s Time] [2022-07-19 22:12:14,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-07-19 22:12:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2022-07-19 22:12:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 249 states have (on average 1.2530120481927711) internal successors, (312), 250 states have internal predecessors, (312), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2022-07-19 22:12:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 488 transitions. [2022-07-19 22:12:14,307 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 488 transitions. Word has length 148 [2022-07-19 22:12:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:14,308 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 488 transitions. [2022-07-19 22:12:14,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-19 22:12:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 488 transitions. [2022-07-19 22:12:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-19 22:12:14,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:14,310 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:14,333 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-19 22:12:14,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:12:14,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:14,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:14,524 INFO L85 PathProgramCache]: Analyzing trace with hash -510156165, now seen corresponding path program 1 times [2022-07-19 22:12:14,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:14,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142993705] [2022-07-19 22:12:14,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:14,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 22:12:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:12:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-19 22:12:14,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:14,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142993705] [2022-07-19 22:12:14,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142993705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:14,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:14,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:12:14,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139280089] [2022-07-19 22:12:14,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:14,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:12:14,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:14,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:12:14,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:12:14,938 INFO L87 Difference]: Start difference. First operand 367 states and 488 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-19 22:12:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:16,544 INFO L93 Difference]: Finished difference Result 733 states and 982 transitions. [2022-07-19 22:12:16,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:12:16,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2022-07-19 22:12:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:16,548 INFO L225 Difference]: With dead ends: 733 [2022-07-19 22:12:16,548 INFO L226 Difference]: Without dead ends: 419 [2022-07-19 22:12:16,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:12:16,551 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 433 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:16,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1622 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 22:12:16,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-07-19 22:12:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 369. [2022-07-19 22:12:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 250 states have (on average 1.252) internal successors, (313), 252 states have internal predecessors, (313), 86 states have call successors, (86), 30 states have call predecessors, (86), 32 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-07-19 22:12:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 494 transitions. [2022-07-19 22:12:16,568 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 494 transitions. Word has length 153 [2022-07-19 22:12:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:16,568 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 494 transitions. [2022-07-19 22:12:16,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-19 22:12:16,569 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 494 transitions. [2022-07-19 22:12:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-19 22:12:16,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:16,570 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:16,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 22:12:16,570 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:16,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1781778211, now seen corresponding path program 1 times [2022-07-19 22:12:16,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:16,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762482989] [2022-07-19 22:12:16,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:16,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 22:12:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 22:12:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-19 22:12:17,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:17,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762482989] [2022-07-19 22:12:17,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762482989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:17,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:17,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:12:17,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290410848] [2022-07-19 22:12:17,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:17,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:12:17,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:17,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:12:17,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:12:17,706 INFO L87 Difference]: Start difference. First operand 369 states and 494 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-19 22:12:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:19,721 INFO L93 Difference]: Finished difference Result 427 states and 573 transitions. [2022-07-19 22:12:19,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:12:19,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2022-07-19 22:12:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:19,724 INFO L225 Difference]: With dead ends: 427 [2022-07-19 22:12:19,724 INFO L226 Difference]: Without dead ends: 425 [2022-07-19 22:12:19,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:12:19,725 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 217 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:19,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1505 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-19 22:12:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-07-19 22:12:19,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 373. [2022-07-19 22:12:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 253 states have (on average 1.2490118577075098) internal successors, (316), 255 states have internal predecessors, (316), 86 states have call successors, (86), 31 states have call predecessors, (86), 33 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-07-19 22:12:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 497 transitions. [2022-07-19 22:12:19,741 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 497 transitions. Word has length 158 [2022-07-19 22:12:19,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:19,741 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 497 transitions. [2022-07-19 22:12:19,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-19 22:12:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 497 transitions. [2022-07-19 22:12:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-19 22:12:19,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:19,743 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:19,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:12:19,743 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:19,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash 655304915, now seen corresponding path program 1 times [2022-07-19 22:12:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:19,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507019952] [2022-07-19 22:12:19,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:19,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 22:12:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 22:12:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:12:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 22:12:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-19 22:12:20,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:20,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507019952] [2022-07-19 22:12:20,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507019952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:20,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:20,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:12:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988590319] [2022-07-19 22:12:20,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:20,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:12:20,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:20,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:12:20,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:12:20,326 INFO L87 Difference]: Start difference. First operand 373 states and 497 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-19 22:12:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:22,135 INFO L93 Difference]: Finished difference Result 433 states and 579 transitions. [2022-07-19 22:12:22,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:12:22,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2022-07-19 22:12:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:22,138 INFO L225 Difference]: With dead ends: 433 [2022-07-19 22:12:22,138 INFO L226 Difference]: Without dead ends: 431 [2022-07-19 22:12:22,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:12:22,139 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 325 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:22,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1446 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-19 22:12:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-07-19 22:12:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 378. [2022-07-19 22:12:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 256 states have (on average 1.24609375) internal successors, (319), 259 states have internal predecessors, (319), 87 states have call successors, (87), 32 states have call predecessors, (87), 34 states have return successors, (96), 86 states have call predecessors, (96), 86 states have call successors, (96) [2022-07-19 22:12:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 502 transitions. [2022-07-19 22:12:22,169 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 502 transitions. Word has length 171 [2022-07-19 22:12:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:22,171 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 502 transitions. [2022-07-19 22:12:22,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-19 22:12:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 502 transitions. [2022-07-19 22:12:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-19 22:12:22,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:22,174 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:22,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 22:12:22,174 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:22,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:22,174 INFO L85 PathProgramCache]: Analyzing trace with hash 657151957, now seen corresponding path program 1 times [2022-07-19 22:12:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:22,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076573957] [2022-07-19 22:12:22,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:22,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 22:12:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 22:12:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:12:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 22:12:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-19 22:12:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:22,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076573957] [2022-07-19 22:12:22,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076573957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:22,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:22,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:12:22,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832100417] [2022-07-19 22:12:22,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:22,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:12:22,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:22,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:12:22,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:12:22,796 INFO L87 Difference]: Start difference. First operand 378 states and 502 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-19 22:12:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:24,415 INFO L93 Difference]: Finished difference Result 436 states and 581 transitions. [2022-07-19 22:12:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:12:24,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2022-07-19 22:12:24,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:24,418 INFO L225 Difference]: With dead ends: 436 [2022-07-19 22:12:24,418 INFO L226 Difference]: Without dead ends: 434 [2022-07-19 22:12:24,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:12:24,418 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 438 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:24,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1419 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 22:12:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-07-19 22:12:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 377. [2022-07-19 22:12:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 256 states have (on average 1.24609375) internal successors, (319), 258 states have internal predecessors, (319), 86 states have call successors, (86), 32 states have call predecessors, (86), 34 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-07-19 22:12:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 500 transitions. [2022-07-19 22:12:24,450 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 500 transitions. Word has length 171 [2022-07-19 22:12:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:24,450 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 500 transitions. [2022-07-19 22:12:24,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-19 22:12:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 500 transitions. [2022-07-19 22:12:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-19 22:12:24,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:24,452 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:24,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 22:12:24,453 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:24,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:24,453 INFO L85 PathProgramCache]: Analyzing trace with hash 220397050, now seen corresponding path program 1 times [2022-07-19 22:12:24,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:24,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493936715] [2022-07-19 22:12:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:24,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:12:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:12:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 22:12:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-19 22:12:24,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:24,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493936715] [2022-07-19 22:12:24,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493936715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:24,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:24,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:12:24,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360289636] [2022-07-19 22:12:24,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:24,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:12:24,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:24,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:12:24,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:12:24,887 INFO L87 Difference]: Start difference. First operand 377 states and 500 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-19 22:12:28,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:28,786 INFO L93 Difference]: Finished difference Result 815 states and 1116 transitions. [2022-07-19 22:12:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 22:12:28,787 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 177 [2022-07-19 22:12:28,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:28,789 INFO L225 Difference]: With dead ends: 815 [2022-07-19 22:12:28,789 INFO L226 Difference]: Without dead ends: 515 [2022-07-19 22:12:28,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:12:28,791 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 999 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 708 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 708 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:28,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 2054 Invalid, 2748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [708 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-19 22:12:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-19 22:12:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 381. [2022-07-19 22:12:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 259 states have (on average 1.2432432432432432) internal successors, (322), 261 states have internal predecessors, (322), 87 states have call successors, (87), 32 states have call predecessors, (87), 34 states have return successors, (96), 87 states have call predecessors, (96), 86 states have call successors, (96) [2022-07-19 22:12:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 505 transitions. [2022-07-19 22:12:28,809 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 505 transitions. Word has length 177 [2022-07-19 22:12:28,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:28,809 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 505 transitions. [2022-07-19 22:12:28,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-19 22:12:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 505 transitions. [2022-07-19 22:12:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-19 22:12:28,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:28,811 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:28,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 22:12:28,811 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:28,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash -597251400, now seen corresponding path program 1 times [2022-07-19 22:12:28,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:28,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634353123] [2022-07-19 22:12:28,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:12:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:12:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 22:12:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-19 22:12:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:29,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634353123] [2022-07-19 22:12:29,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634353123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:29,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:29,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:12:29,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051583508] [2022-07-19 22:12:29,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:29,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:12:29,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:29,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:12:29,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:12:29,255 INFO L87 Difference]: Start difference. First operand 381 states and 505 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-19 22:12:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:31,623 INFO L93 Difference]: Finished difference Result 570 states and 782 transitions. [2022-07-19 22:12:31,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 22:12:31,624 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2022-07-19 22:12:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:31,626 INFO L225 Difference]: With dead ends: 570 [2022-07-19 22:12:31,626 INFO L226 Difference]: Without dead ends: 513 [2022-07-19 22:12:31,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:12:31,627 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 415 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:31,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1967 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 22:12:31,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-19 22:12:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 385. [2022-07-19 22:12:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 262 states have (on average 1.2404580152671756) internal successors, (325), 264 states have internal predecessors, (325), 87 states have call successors, (87), 32 states have call predecessors, (87), 35 states have return successors, (97), 88 states have call predecessors, (97), 86 states have call successors, (97) [2022-07-19 22:12:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2022-07-19 22:12:31,642 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 177 [2022-07-19 22:12:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:31,642 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2022-07-19 22:12:31,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-19 22:12:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2022-07-19 22:12:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-19 22:12:31,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:31,643 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:31,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 22:12:31,644 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:31,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:31,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1081589820, now seen corresponding path program 1 times [2022-07-19 22:12:31,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:31,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154855236] [2022-07-19 22:12:31,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:31,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:12:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:32,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:32,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:12:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:32,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 22:12:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-19 22:12:32,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:32,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154855236] [2022-07-19 22:12:32,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154855236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:32,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:32,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:12:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914510318] [2022-07-19 22:12:32,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:32,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:12:32,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:32,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:12:32,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:12:32,057 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-19 22:12:34,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:34,846 INFO L93 Difference]: Finished difference Result 691 states and 922 transitions. [2022-07-19 22:12:34,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:12:34,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 179 [2022-07-19 22:12:34,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:34,849 INFO L225 Difference]: With dead ends: 691 [2022-07-19 22:12:34,849 INFO L226 Difference]: Without dead ends: 462 [2022-07-19 22:12:34,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:12:34,850 INFO L413 NwaCegarLoop]: 455 mSDtfsCounter, 472 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:34,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1125 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-19 22:12:34,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-07-19 22:12:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 386. [2022-07-19 22:12:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 263 states have (on average 1.2395437262357414) internal successors, (326), 265 states have internal predecessors, (326), 87 states have call successors, (87), 32 states have call predecessors, (87), 35 states have return successors, (97), 88 states have call predecessors, (97), 86 states have call successors, (97) [2022-07-19 22:12:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2022-07-19 22:12:34,866 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 179 [2022-07-19 22:12:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:34,867 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2022-07-19 22:12:34,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-19 22:12:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2022-07-19 22:12:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-19 22:12:34,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:34,868 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:34,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 22:12:34,869 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:34,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash -517004810, now seen corresponding path program 1 times [2022-07-19 22:12:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:34,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770783516] [2022-07-19 22:12:34,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:34,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:12:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:12:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-19 22:12:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 22:12:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-19 22:12:35,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:35,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770783516] [2022-07-19 22:12:35,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770783516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:35,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:35,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 22:12:35,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541920016] [2022-07-19 22:12:35,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:35,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 22:12:35,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:35,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 22:12:35,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:12:35,409 INFO L87 Difference]: Start difference. First operand 386 states and 510 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-19 22:12:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:37,548 INFO L93 Difference]: Finished difference Result 839 states and 1140 transitions. [2022-07-19 22:12:37,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 22:12:37,548 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) Word has length 186 [2022-07-19 22:12:37,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:37,568 INFO L225 Difference]: With dead ends: 839 [2022-07-19 22:12:37,568 INFO L226 Difference]: Without dead ends: 546 [2022-07-19 22:12:37,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2022-07-19 22:12:37,569 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 531 mSDsluCounter, 2800 mSDsCounter, 0 mSdLazyCounter, 2974 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 3282 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 2974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:37,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 3282 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 2974 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-19 22:12:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-19 22:12:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 435. [2022-07-19 22:12:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 299 states have (on average 1.2508361204013378) internal successors, (374), 302 states have internal predecessors, (374), 95 states have call successors, (95), 35 states have call predecessors, (95), 40 states have return successors, (110), 97 states have call predecessors, (110), 94 states have call successors, (110) [2022-07-19 22:12:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 579 transitions. [2022-07-19 22:12:37,591 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 579 transitions. Word has length 186 [2022-07-19 22:12:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:37,592 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 579 transitions. [2022-07-19 22:12:37,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-19 22:12:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 579 transitions. [2022-07-19 22:12:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-19 22:12:37,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:37,593 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:37,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 22:12:37,594 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:37,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:37,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1223849872, now seen corresponding path program 1 times [2022-07-19 22:12:37,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:37,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415697262] [2022-07-19 22:12:37,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:37,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:12:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:12:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:37,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 22:12:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-19 22:12:38,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:38,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415697262] [2022-07-19 22:12:38,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415697262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:38,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:38,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:12:38,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385836442] [2022-07-19 22:12:38,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:38,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:12:38,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:38,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:12:38,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:12:38,002 INFO L87 Difference]: Start difference. First operand 435 states and 579 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-19 22:12:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:43,364 INFO L93 Difference]: Finished difference Result 636 states and 870 transitions. [2022-07-19 22:12:43,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 22:12:43,364 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 183 [2022-07-19 22:12:43,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:43,366 INFO L225 Difference]: With dead ends: 636 [2022-07-19 22:12:43,366 INFO L226 Difference]: Without dead ends: 579 [2022-07-19 22:12:43,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:12:43,367 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 314 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:43,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 2738 Invalid, 2498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2346 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-19 22:12:43,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-07-19 22:12:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 443. [2022-07-19 22:12:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 307 states have (on average 1.250814332247557) internal successors, (384), 310 states have internal predecessors, (384), 95 states have call successors, (95), 35 states have call predecessors, (95), 40 states have return successors, (110), 97 states have call predecessors, (110), 94 states have call successors, (110) [2022-07-19 22:12:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 589 transitions. [2022-07-19 22:12:43,385 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 589 transitions. Word has length 183 [2022-07-19 22:12:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:43,385 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 589 transitions. [2022-07-19 22:12:43,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-19 22:12:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 589 transitions. [2022-07-19 22:12:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-19 22:12:43,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:43,387 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:43,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 22:12:43,387 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:43,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1686982824, now seen corresponding path program 1 times [2022-07-19 22:12:43,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:43,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061061067] [2022-07-19 22:12:43,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:43,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:12:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:12:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 22:12:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 22:12:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-19 22:12:43,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:43,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061061067] [2022-07-19 22:12:43,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061061067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:43,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:43,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:12:43,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756602483] [2022-07-19 22:12:43,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:43,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:12:43,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:43,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:12:43,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:12:43,762 INFO L87 Difference]: Start difference. First operand 443 states and 589 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2022-07-19 22:12:47,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:47,542 INFO L93 Difference]: Finished difference Result 578 states and 774 transitions. [2022-07-19 22:12:47,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 22:12:47,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2022-07-19 22:12:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:47,545 INFO L225 Difference]: With dead ends: 578 [2022-07-19 22:12:47,545 INFO L226 Difference]: Without dead ends: 523 [2022-07-19 22:12:47,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:12:47,546 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 589 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:47,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1621 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-19 22:12:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-19 22:12:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 448. [2022-07-19 22:12:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 311 states have (on average 1.247588424437299) internal successors, (388), 314 states have internal predecessors, (388), 95 states have call successors, (95), 35 states have call predecessors, (95), 41 states have return successors, (112), 98 states have call predecessors, (112), 94 states have call successors, (112) [2022-07-19 22:12:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 595 transitions. [2022-07-19 22:12:47,568 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 595 transitions. Word has length 187 [2022-07-19 22:12:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:47,568 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 595 transitions. [2022-07-19 22:12:47,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2022-07-19 22:12:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 595 transitions. [2022-07-19 22:12:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 22:12:47,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:47,570 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:47,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 22:12:47,570 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:47,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:47,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1674366495, now seen corresponding path program 1 times [2022-07-19 22:12:47,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:47,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564418929] [2022-07-19 22:12:47,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:47,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:12:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:48,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:48,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:12:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:48,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-19 22:12:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:48,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 22:12:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:48,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 22:12:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:48,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-19 22:12:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2022-07-19 22:12:48,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:48,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564418929] [2022-07-19 22:12:48,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564418929] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:12:48,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733143826] [2022-07-19 22:12:48,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:48,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:12:48,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:12:48,352 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-19 22:12:48,353 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-19 22:12:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:49,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 3138 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-19 22:12:49,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:12:49,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 22:12:49,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 22:12:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-07-19 22:12:49,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:12:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-19 22:12:49,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733143826] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:12:49,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:12:49,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 19 [2022-07-19 22:12:49,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535550019] [2022-07-19 22:12:49,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:12:49,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 22:12:49,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:49,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 22:12:49,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:12:49,742 INFO L87 Difference]: Start difference. First operand 448 states and 595 transitions. Second operand has 19 states, 16 states have (on average 6.875) internal successors, (110), 14 states have internal predecessors, (110), 10 states have call successors, (43), 7 states have call predecessors, (43), 5 states have return successors, (35), 6 states have call predecessors, (35), 8 states have call successors, (35) [2022-07-19 22:12:53,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:53,031 INFO L93 Difference]: Finished difference Result 891 states and 1202 transitions. [2022-07-19 22:12:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 22:12:53,031 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.875) internal successors, (110), 14 states have internal predecessors, (110), 10 states have call successors, (43), 7 states have call predecessors, (43), 5 states have return successors, (35), 6 states have call predecessors, (35), 8 states have call successors, (35) Word has length 190 [2022-07-19 22:12:53,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:53,033 INFO L225 Difference]: With dead ends: 891 [2022-07-19 22:12:53,033 INFO L226 Difference]: Without dead ends: 548 [2022-07-19 22:12:53,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 428 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2022-07-19 22:12:53,035 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 599 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 3918 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 4380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 3918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:53,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 3520 Invalid, 4380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 3918 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-19 22:12:53,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-19 22:12:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 464. [2022-07-19 22:12:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 318 states have (on average 1.2421383647798743) internal successors, (395), 321 states have internal predecessors, (395), 103 states have call successors, (103), 36 states have call predecessors, (103), 42 states have return successors, (118), 106 states have call predecessors, (118), 102 states have call successors, (118) [2022-07-19 22:12:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 616 transitions. [2022-07-19 22:12:53,060 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 616 transitions. Word has length 190 [2022-07-19 22:12:53,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:53,060 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 616 transitions. [2022-07-19 22:12:53,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.875) internal successors, (110), 14 states have internal predecessors, (110), 10 states have call successors, (43), 7 states have call predecessors, (43), 5 states have return successors, (35), 6 states have call predecessors, (35), 8 states have call successors, (35) [2022-07-19 22:12:53,061 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 616 transitions. [2022-07-19 22:12:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 22:12:53,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:53,062 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:53,085 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-19 22:12:53,279 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,SelfDestructingSolverStorable16 [2022-07-19 22:12:53,280 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:53,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1404350850, now seen corresponding path program 1 times [2022-07-19 22:12:53,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:53,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377207807] [2022-07-19 22:12:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:12:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:12:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-19 22:12:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 22:12:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-19 22:12:53,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:53,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377207807] [2022-07-19 22:12:53,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377207807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:53,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:53,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:12:53,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522028545] [2022-07-19 22:12:53,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:53,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:12:53,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:53,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:12:53,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:12:53,600 INFO L87 Difference]: Start difference. First operand 464 states and 616 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (32), 5 states have call predecessors, (32), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-19 22:12:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:54,973 INFO L93 Difference]: Finished difference Result 953 states and 1292 transitions. [2022-07-19 22:12:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:12:54,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (32), 5 states have call predecessors, (32), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 190 [2022-07-19 22:12:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:54,976 INFO L225 Difference]: With dead ends: 953 [2022-07-19 22:12:54,976 INFO L226 Difference]: Without dead ends: 576 [2022-07-19 22:12:54,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:12:54,988 INFO L413 NwaCegarLoop]: 483 mSDtfsCounter, 525 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:54,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1474 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 22:12:54,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-07-19 22:12:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 458. [2022-07-19 22:12:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 313 states have (on average 1.2396166134185302) internal successors, (388), 317 states have internal predecessors, (388), 102 states have call successors, (102), 36 states have call predecessors, (102), 42 states have return successors, (116), 104 states have call predecessors, (116), 101 states have call successors, (116) [2022-07-19 22:12:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 606 transitions. [2022-07-19 22:12:55,024 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 606 transitions. Word has length 190 [2022-07-19 22:12:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:55,025 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 606 transitions. [2022-07-19 22:12:55,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (32), 5 states have call predecessors, (32), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-19 22:12:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 606 transitions. [2022-07-19 22:12:55,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 22:12:55,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:55,026 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:55,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 22:12:55,027 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1563869444, now seen corresponding path program 1 times [2022-07-19 22:12:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:55,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156867481] [2022-07-19 22:12:55,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:55,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:12:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:12:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-19 22:12:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 22:12:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-19 22:12:55,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:55,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156867481] [2022-07-19 22:12:55,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156867481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:55,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:55,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 22:12:55,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839334584] [2022-07-19 22:12:55,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:55,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 22:12:55,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:55,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 22:12:55,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:12:55,491 INFO L87 Difference]: Start difference. First operand 458 states and 606 transitions. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 9 states have internal predecessors, (88), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-19 22:12:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:58,305 INFO L93 Difference]: Finished difference Result 900 states and 1217 transitions. [2022-07-19 22:12:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 22:12:58,306 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 9 states have internal predecessors, (88), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) Word has length 190 [2022-07-19 22:12:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:58,308 INFO L225 Difference]: With dead ends: 900 [2022-07-19 22:12:58,308 INFO L226 Difference]: Without dead ends: 593 [2022-07-19 22:12:58,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2022-07-19 22:12:58,310 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 689 mSDsluCounter, 2943 mSDsCounter, 0 mSdLazyCounter, 3255 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 3410 SdHoareTripleChecker+Invalid, 3716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 3255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:58,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 3410 Invalid, 3716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 3255 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-19 22:12:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-07-19 22:12:58,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 479. [2022-07-19 22:12:58,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 324 states have (on average 1.2345679012345678) internal successors, (400), 328 states have internal predecessors, (400), 110 states have call successors, (110), 38 states have call predecessors, (110), 44 states have return successors, (126), 112 states have call predecessors, (126), 109 states have call successors, (126) [2022-07-19 22:12:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 636 transitions. [2022-07-19 22:12:58,332 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 636 transitions. Word has length 190 [2022-07-19 22:12:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:58,333 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 636 transitions. [2022-07-19 22:12:58,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 9 states have internal predecessors, (88), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-19 22:12:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 636 transitions. [2022-07-19 22:12:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-19 22:12:58,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:58,334 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:58,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 22:12:58,335 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:58,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:58,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1811820170, now seen corresponding path program 1 times [2022-07-19 22:12:58,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:58,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908095539] [2022-07-19 22:12:58,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:12:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:12:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:12:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:12:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:12:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:12:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 22:12:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-19 22:12:58,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:58,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908095539] [2022-07-19 22:12:58,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908095539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:58,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:58,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:12:58,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358893077] [2022-07-19 22:12:58,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:58,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:12:58,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:58,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:12:58,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:12:58,721 INFO L87 Difference]: Start difference. First operand 479 states and 636 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-19 22:13:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:00,860 INFO L93 Difference]: Finished difference Result 798 states and 1064 transitions. [2022-07-19 22:13:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:13:00,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 185 [2022-07-19 22:13:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:00,863 INFO L225 Difference]: With dead ends: 798 [2022-07-19 22:13:00,863 INFO L226 Difference]: Without dead ends: 556 [2022-07-19 22:13:00,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:13:00,864 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 359 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:00,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1125 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 22:13:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-07-19 22:13:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 481. [2022-07-19 22:13:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 326 states have (on average 1.2331288343558282) internal successors, (402), 330 states have internal predecessors, (402), 110 states have call successors, (110), 38 states have call predecessors, (110), 44 states have return successors, (126), 112 states have call predecessors, (126), 109 states have call successors, (126) [2022-07-19 22:13:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 638 transitions. [2022-07-19 22:13:00,890 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 638 transitions. Word has length 185 [2022-07-19 22:13:00,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:00,891 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 638 transitions. [2022-07-19 22:13:00,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-19 22:13:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 638 transitions. [2022-07-19 22:13:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-19 22:13:00,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:00,893 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:00,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 22:13:00,893 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:00,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:00,894 INFO L85 PathProgramCache]: Analyzing trace with hash -103866992, now seen corresponding path program 1 times [2022-07-19 22:13:00,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:00,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944269735] [2022-07-19 22:13:00,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:00,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:01,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:01,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:13:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:01,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:13:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:13:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:13:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:13:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:13:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:13:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:13:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:13:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:13:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:13:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:13:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:13:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:13:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:13:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:13:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:13:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:13:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:13:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:13:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:13:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:13:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 22:13:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 22:13:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:13:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:13:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-19 22:13:02,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:02,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944269735] [2022-07-19 22:13:02,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944269735] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:13:02,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379425857] [2022-07-19 22:13:02,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:02,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:13:02,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:13:02,219 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-19 22:13:02,220 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-19 22:13:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:03,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-19 22:13:03,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:13:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-19 22:13:03,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:13:03,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379425857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:13:03,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:13:03,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2022-07-19 22:13:03,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276180644] [2022-07-19 22:13:03,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:13:03,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:13:03,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:03,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:13:03,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:13:03,294 INFO L87 Difference]: Start difference. First operand 481 states and 638 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-19 22:13:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:03,581 INFO L93 Difference]: Finished difference Result 955 states and 1265 transitions. [2022-07-19 22:13:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:13:03,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 193 [2022-07-19 22:13:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:03,585 INFO L225 Difference]: With dead ends: 955 [2022-07-19 22:13:03,585 INFO L226 Difference]: Without dead ends: 483 [2022-07-19 22:13:03,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:13:03,587 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 91 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:03,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 2443 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:13:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-07-19 22:13:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2022-07-19 22:13:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 327 states have (on average 1.2324159021406729) internal successors, (403), 332 states have internal predecessors, (403), 110 states have call successors, (110), 38 states have call predecessors, (110), 45 states have return successors, (127), 112 states have call predecessors, (127), 109 states have call successors, (127) [2022-07-19 22:13:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 640 transitions. [2022-07-19 22:13:03,615 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 640 transitions. Word has length 193 [2022-07-19 22:13:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:03,616 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 640 transitions. [2022-07-19 22:13:03,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-19 22:13:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 640 transitions. [2022-07-19 22:13:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-19 22:13:03,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:03,618 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:03,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 22:13:03,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:13:03,856 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2131388023, now seen corresponding path program 1 times [2022-07-19 22:13:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:03,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324689467] [2022-07-19 22:13:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:03,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:03,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 22:13:03,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1468512792] [2022-07-19 22:13:03,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:03,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:13:03,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:13:03,935 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-19 22:13:03,957 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-19 22:13:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:05,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 3324 conjuncts, 292 conjunts are in the unsatisfiable core [2022-07-19 22:13:05,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:13:05,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:13:05,482 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:13:05,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:13:05,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 22:13:05,824 INFO L356 Elim1Store]: treesize reduction 112, result has 28.7 percent of original size [2022-07-19 22:13:05,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 88 treesize of output 114 [2022-07-19 22:13:06,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 22:13:06,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:13:06,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-19 22:13:06,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 22:13:06,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 22:13:06,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:13:06,116 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-19 22:13:06,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2022-07-19 22:13:06,650 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 22:13:06,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-19 22:13:06,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:13:06,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-19 22:13:06,933 INFO L356 Elim1Store]: treesize reduction 102, result has 17.1 percent of original size [2022-07-19 22:13:06,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:06,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324689467] [2022-07-19 22:13:06,934 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 22:13:06,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468512792] [2022-07-19 22:13:06,935 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 22:13:06,975 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-19 22:13:07,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:13:07,136 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_184| input size 111 context size 111 output size 111 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 22:13:07,139 INFO L158 Benchmark]: Toolchain (without parser) took 77424.32ms. Allocated memory was 102.8MB in the beginning and 792.7MB in the end (delta: 690.0MB). Free memory was 61.2MB in the beginning and 285.4MB in the end (delta: -224.2MB). Peak memory consumption was 464.4MB. Max. memory is 16.1GB. [2022-07-19 22:13:07,140 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory was 60.2MB in the beginning and 60.2MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:13:07,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2082.83ms. Allocated memory was 102.8MB in the beginning and 165.7MB in the end (delta: 62.9MB). Free memory was 61.0MB in the beginning and 83.2MB in the end (delta: -22.2MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2022-07-19 22:13:07,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 184.71ms. Allocated memory is still 165.7MB. Free memory was 83.2MB in the beginning and 67.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 22:13:07,140 INFO L158 Benchmark]: Boogie Preprocessor took 98.16ms. Allocated memory is still 165.7MB. Free memory was 67.4MB in the beginning and 99.3MB in the end (delta: -31.9MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2022-07-19 22:13:07,140 INFO L158 Benchmark]: RCFGBuilder took 1466.30ms. Allocated memory was 165.7MB in the beginning and 207.6MB in the end (delta: 41.9MB). Free memory was 99.3MB in the beginning and 69.3MB in the end (delta: 30.0MB). Peak memory consumption was 73.9MB. Max. memory is 16.1GB. [2022-07-19 22:13:07,140 INFO L158 Benchmark]: TraceAbstraction took 73575.90ms. Allocated memory was 207.6MB in the beginning and 792.7MB in the end (delta: 585.1MB). Free memory was 138.7MB in the beginning and 285.4MB in the end (delta: -146.7MB). Peak memory consumption was 437.3MB. Max. memory is 16.1GB. [2022-07-19 22:13:07,141 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory was 60.2MB in the beginning and 60.2MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2082.83ms. Allocated memory was 102.8MB in the beginning and 165.7MB in the end (delta: 62.9MB). Free memory was 61.0MB in the beginning and 83.2MB in the end (delta: -22.2MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 184.71ms. Allocated memory is still 165.7MB. Free memory was 83.2MB in the beginning and 67.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.16ms. Allocated memory is still 165.7MB. Free memory was 67.4MB in the beginning and 99.3MB in the end (delta: -31.9MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1466.30ms. Allocated memory was 165.7MB in the beginning and 207.6MB in the end (delta: 41.9MB). Free memory was 99.3MB in the beginning and 69.3MB in the end (delta: 30.0MB). Peak memory consumption was 73.9MB. Max. memory is 16.1GB. * TraceAbstraction took 73575.90ms. Allocated memory was 207.6MB in the beginning and 792.7MB in the end (delta: 585.1MB). Free memory was 138.7MB in the beginning and 285.4MB in the end (delta: -146.7MB). Peak memory consumption was 437.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_184| input size 111 context size 111 output size 111 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_184| input size 111 context size 111 output size 111: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 22:13:07,277 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_hash_table_put_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 7e3410638a547f2efce35a13c7d23c64ee660b1c493ec273ce9d4043edc218c3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:13:09,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:13:09,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:13:09,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:13:09,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:13:09,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:13:09,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:13:09,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:13:09,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:13:09,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:13:09,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:13:09,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:13:09,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:13:09,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:13:09,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:13:09,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:13:09,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:13:09,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:13:09,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:13:09,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:13:09,317 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:13:09,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:13:09,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:13:09,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:13:09,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:13:09,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:13:09,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:13:09,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:13:09,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:13:09,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:13:09,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:13:09,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:13:09,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:13:09,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:13:09,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:13:09,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:13:09,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:13:09,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:13:09,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:13:09,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:13:09,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:13:09,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:13:09,342 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-19 22:13:09,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:13:09,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:13:09,367 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:13:09,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:13:09,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:13:09,368 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:13:09,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:13:09,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:13:09,369 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:13:09,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:13:09,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:13:09,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:13:09,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:13:09,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:13:09,371 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 22:13:09,375 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 22:13:09,376 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 22:13:09,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:13:09,376 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:13:09,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:13:09,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:13:09,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:13:09,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:13:09,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:13:09,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:13:09,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:13:09,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:13:09,377 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 22:13:09,377 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 22:13:09,378 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:13:09,378 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:13:09,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:13:09,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 22:13:09,378 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 7e3410638a547f2efce35a13c7d23c64ee660b1c493ec273ce9d4043edc218c3 [2022-07-19 22:13:09,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:13:09,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:13:09,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:13:09,679 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:13:09,680 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:13:09,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i [2022-07-19 22:13:09,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa620a6eb/1da23fc32d0b40419615711ac3f77df7/FLAG3dcaa1ac8 [2022-07-19 22:13:10,409 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:13:10,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i [2022-07-19 22:13:10,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa620a6eb/1da23fc32d0b40419615711ac3f77df7/FLAG3dcaa1ac8 [2022-07-19 22:13:10,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa620a6eb/1da23fc32d0b40419615711ac3f77df7 [2022-07-19 22:13:10,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:13:10,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:13:10,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:13:10,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:13:10,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:13:10,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:13:10" (1/1) ... [2022-07-19 22:13:10,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27952471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:10, skipping insertion in model container [2022-07-19 22:13:10,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:13:10" (1/1) ... [2022-07-19 22:13:10,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:13:10,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:13:11,143 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_hash_table_put_harness.i[4492,4505] [2022-07-19 22:13:11,149 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_hash_table_put_harness.i[4552,4565] [2022-07-19 22:13:11,777 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:11,778 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:11,778 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:11,778 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:11,779 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:11,789 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:11,789 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:11,790 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:11,791 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:11,792 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:11,792 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:11,793 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:11,793 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:12,001 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:13:12,002 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:13:12,003 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:13:12,003 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:13:12,004 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:13:12,004 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:13:12,005 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:13:12,005 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:13:12,006 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:13:12,006 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:13:12,106 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:13:12,122 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:177) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:675) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1454) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1397) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 22:13:12,126 INFO L158 Benchmark]: Toolchain (without parser) took 1336.53ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 30.2MB in the beginning and 31.4MB in the end (delta: -1.3MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2022-07-19 22:13:12,127 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory was 34.1MB in the beginning and 34.0MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:13:12,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1333.50ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 30.0MB in the beginning and 31.4MB in the end (delta: -1.4MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2022-07-19 22:13:12,128 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.16ms. Allocated memory is still 52.4MB. Free memory was 34.1MB in the beginning and 34.0MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1333.50ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 30.0MB in the beginning and 31.4MB in the end (delta: -1.4MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range