./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R --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 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:42:37,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:42:37,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:42:37,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:42:37,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:42:37,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:42:37,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:42:37,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:42:37,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:42:37,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:42:37,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:42:37,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:42:37,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:42:37,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:42:37,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:42:37,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:42:37,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:42:37,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:42:37,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:42:37,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:42:37,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:42:37,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:42:37,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:42:37,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:42:37,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:42:37,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:42:37,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:42:37,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:42:37,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:42:37,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:42:37,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:42:37,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:42:37,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:42:37,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:42:37,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:42:37,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:42:37,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:42:37,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:42:37,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:42:37,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:42:37,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:42:37,728 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 15:42:37,752 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:42:37,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:42:37,753 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:42:37,753 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:42:37,754 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:42:37,754 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:42:37,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:42:37,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:42:37,755 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:42:37,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:42:37,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:42:37,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:42:37,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:42:37,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:42:37,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:42:37,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:42:37,758 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:42:37,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:42:37,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:42:37,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:42:37,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:42:37,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:42:37,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:42:37,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:42:37,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:42:37,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:42:37,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:42:37,761 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:42:37,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:42:37,761 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:42:37,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:42:37,762 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R 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 -> 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 [2022-11-25 15:42:38,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:42:38,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:42:38,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:42:38,069 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:42:38,069 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:42:38,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i [2022-11-25 15:42:41,157 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:42:41,762 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:42:41,763 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i [2022-11-25 15:42:41,807 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/data/64c41fd0d/30f7badd971e47b2a134da2e1ee8903d/FLAG8f8b2d295 [2022-11-25 15:42:41,830 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/data/64c41fd0d/30f7badd971e47b2a134da2e1ee8903d [2022-11-25 15:42:41,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:42:41,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:42:41,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:42:41,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:42:41,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:42:41,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:42:41" (1/1) ... [2022-11-25 15:42:41,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1819ccb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:41, skipping insertion in model container [2022-11-25 15:42:41,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:42:41" (1/1) ... [2022-11-25 15:42:41,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:42:41,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:42:42,279 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i[4505,4518] [2022-11-25 15:42:42,289 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i[4565,4578] [2022-11-25 15:42:43,313 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:43,314 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:43,315 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:43,316 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:43,317 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:43,339 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:43,347 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:43,355 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:43,356 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:43,445 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 15:42:43,446 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 15:42:43,447 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 15:42:43,453 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 15:42:43,455 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 15:42:43,456 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 15:42:43,831 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 15:42:43,835 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 15:42:43,838 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 15:42:43,841 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 15:42:43,845 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 15:42:43,850 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 15:42:43,852 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 15:42:43,857 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 15:42:43,858 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 15:42:43,864 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 15:42:43,866 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 15:42:44,095 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 15:42:44,119 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:42:44,138 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 15:42:44,148 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:42:44,310 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:44,318 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:44,390 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 15:42:44,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:42:44,467 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:42:44,495 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i[4505,4518] [2022-11-25 15:42:44,495 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i[4565,4578] [2022-11-25 15:42:44,538 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:44,539 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:44,539 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:44,540 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:44,540 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:44,549 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:44,550 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:44,551 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:44,552 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:44,564 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 15:42:44,565 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 15:42:44,565 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 15:42:44,569 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 15:42:44,571 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 15:42:44,571 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 15:42:44,607 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 15:42:44,608 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 15:42:44,608 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 15:42:44,609 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 15:42:44,610 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 15:42:44,610 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 15:42:44,611 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 15:42:44,611 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 15:42:44,612 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 15:42:44,612 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 15:42:44,613 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 15:42:44,649 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 15:42:44,670 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:42:44,688 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 15:42:44,698 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:42:44,724 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:44,725 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:42:44,751 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 15:42:44,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:42:45,061 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:42:45,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:45 WrapperNode [2022-11-25 15:42:45,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:42:45,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:42:45,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:42:45,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:42:45,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:45" (1/1) ... [2022-11-25 15:42:45,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:45" (1/1) ... [2022-11-25 15:42:45,298 INFO L138 Inliner]: procedures = 691, calls = 2655, calls flagged for inlining = 59, calls inlined = 6, statements flattened = 920 [2022-11-25 15:42:45,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:42:45,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:42:45,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:42:45,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:42:45,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:45" (1/1) ... [2022-11-25 15:42:45,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:45" (1/1) ... [2022-11-25 15:42:45,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:45" (1/1) ... [2022-11-25 15:42:45,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:45" (1/1) ... [2022-11-25 15:42:45,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:45" (1/1) ... [2022-11-25 15:42:45,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:45" (1/1) ... [2022-11-25 15:42:45,414 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:45" (1/1) ... [2022-11-25 15:42:45,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:45" (1/1) ... [2022-11-25 15:42:45,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:42:45,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:42:45,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:42:45,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:42:45,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:45" (1/1) ... [2022-11-25 15:42:45,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:42:45,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:42:45,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:42:45,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:42:45,524 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-11-25 15:42:45,524 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-11-25 15:42:45,525 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_compare_lexical [2022-11-25 15:42:45,525 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_compare_lexical [2022-11-25 15:42:45,525 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-25 15:42:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:42:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-25 15:42:45,526 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-25 15:42:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:42:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_bounded [2022-11-25 15:42:45,526 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_bounded [2022-11-25 15:42:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 15:42:45,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 15:42:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 15:42:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:42:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-11-25 15:42:45,529 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-11-25 15:42:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 15:42:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:42:45,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:42:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-25 15:42:45,529 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-25 15:42:45,530 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-11-25 15:42:45,530 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-11-25 15:42:45,530 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 15:42:45,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 15:42:45,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:42:45,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 15:42:45,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 15:42:45,532 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-25 15:42:45,532 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-25 15:42:45,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:42:45,532 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-11-25 15:42:45,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-11-25 15:42:45,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:42:45,883 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:42:45,885 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:42:47,350 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:42:47,359 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:42:47,360 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:42:47,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:42:47 BoogieIcfgContainer [2022-11-25 15:42:47,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:42:47,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:42:47,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:42:47,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:42:47,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:42:41" (1/3) ... [2022-11-25 15:42:47,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af57968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:42:47, skipping insertion in model container [2022-11-25 15:42:47,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:42:45" (2/3) ... [2022-11-25 15:42:47,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af57968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:42:47, skipping insertion in model container [2022-11-25 15:42:47,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:42:47" (3/3) ... [2022-11-25 15:42:47,378 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_compare_lexical_harness.i [2022-11-25 15:42:47,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:42:47,398 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 15:42:47,469 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:42:47,478 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64992153, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:42:47,478 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 15:42:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 91 states have internal predecessors, (110), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 15:42:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-25 15:42:47,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:47,535 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 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] [2022-11-25 15:42:47,536 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:42:47,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:47,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1837511076, now seen corresponding path program 1 times [2022-11-25 15:42:47,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:42:47,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491351851] [2022-11-25 15:42:47,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:47,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:42:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:42:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:42:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:42:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:42:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 15:42:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 15:42:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 15:42:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:42:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:42:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:42:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:42:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:42:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:42:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:42:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:42:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 15:42:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 15:42:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:42:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-11-25 15:42:48,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:42:48,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491351851] [2022-11-25 15:42:48,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491351851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:48,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:42:48,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:42:48,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675880103] [2022-11-25 15:42:48,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:48,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:42:48,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:42:48,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:42:48,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:42:48,698 INFO L87 Difference]: Start difference. First operand has 149 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 91 states have internal predecessors, (110), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 15:42:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:49,267 INFO L93 Difference]: Finished difference Result 297 states and 435 transitions. [2022-11-25 15:42:49,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:42:49,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2022-11-25 15:42:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:49,282 INFO L225 Difference]: With dead ends: 297 [2022-11-25 15:42:49,282 INFO L226 Difference]: Without dead ends: 146 [2022-11-25 15:42:49,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:42:49,292 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 77 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:49,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 168 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 15:42:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-25 15:42:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2022-11-25 15:42:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 85 states have (on average 1.2) internal successors, (102), 86 states have internal predecessors, (102), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-11-25 15:42:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 193 transitions. [2022-11-25 15:42:49,353 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 193 transitions. Word has length 120 [2022-11-25 15:42:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:49,353 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 193 transitions. [2022-11-25 15:42:49,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 15:42:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 193 transitions. [2022-11-25 15:42:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-25 15:42:49,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:49,358 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 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] [2022-11-25 15:42:49,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:42:49,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:42:49,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1917331222, now seen corresponding path program 1 times [2022-11-25 15:42:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:42:49,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446057489] [2022-11-25 15:42:49,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:49,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:42:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:42:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:42:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:42:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:42:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 15:42:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 15:42:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 15:42:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:42:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:42:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:42:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:42:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:42:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:42:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:42:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:42:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 15:42:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 15:42:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:42:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-25 15:42:50,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:42:50,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446057489] [2022-11-25 15:42:50,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446057489] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:42:50,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776512890] [2022-11-25 15:42:50,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:50,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:42:50,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:42:50,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:42:50,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 15:42:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:51,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 2695 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:42:51,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-11-25 15:42:51,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:42:51,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776512890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:51,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:42:51,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-11-25 15:42:51,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193563867] [2022-11-25 15:42:51,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:51,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:42:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:42:51,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:42:51,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:42:51,243 INFO L87 Difference]: Start difference. First operand 143 states and 193 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-25 15:42:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:51,545 INFO L93 Difference]: Finished difference Result 282 states and 385 transitions. [2022-11-25 15:42:51,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:42:51,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 120 [2022-11-25 15:42:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:51,548 INFO L225 Difference]: With dead ends: 282 [2022-11-25 15:42:51,549 INFO L226 Difference]: Without dead ends: 146 [2022-11-25 15:42:51,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-25 15:42:51,551 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 208 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:51,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 400 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:42:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-25 15:42:51,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-11-25 15:42:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 89 states have internal predecessors, (104), 46 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (51), 45 states have call predecessors, (51), 45 states have call successors, (51) [2022-11-25 15:42:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 201 transitions. [2022-11-25 15:42:51,575 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 201 transitions. Word has length 120 [2022-11-25 15:42:51,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:51,576 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 201 transitions. [2022-11-25 15:42:51,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-25 15:42:51,576 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 201 transitions. [2022-11-25 15:42:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-25 15:42:51,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:51,579 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 3, 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] [2022-11-25 15:42:51,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:51,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-25 15:42:51,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:42:51,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:51,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1681549893, now seen corresponding path program 1 times [2022-11-25 15:42:51,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:42:51,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902899437] [2022-11-25 15:42:51,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:51,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:42:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:42:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:42:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:42:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:42:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:42:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 15:42:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 15:42:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:42:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:42:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 15:42:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 15:42:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 15:42:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-25 15:42:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:42:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 15:42:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-25 15:42:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 15:42:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 15:42:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-25 15:42:52,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:42:52,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902899437] [2022-11-25 15:42:52,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902899437] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:42:52,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300992940] [2022-11-25 15:42:52,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:52,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:42:52,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:42:52,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:42:52,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 15:42:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:53,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 2700 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:42:53,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-25 15:42:53,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:42:53,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300992940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:53,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:42:53,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-11-25 15:42:53,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672917457] [2022-11-25 15:42:53,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:53,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:42:53,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:42:53,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:42:53,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:42:53,708 INFO L87 Difference]: Start difference. First operand 146 states and 201 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-25 15:42:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:54,145 INFO L93 Difference]: Finished difference Result 238 states and 331 transitions. [2022-11-25 15:42:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:42:54,146 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 122 [2022-11-25 15:42:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:54,148 INFO L225 Difference]: With dead ends: 238 [2022-11-25 15:42:54,148 INFO L226 Difference]: Without dead ends: 146 [2022-11-25 15:42:54,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-11-25 15:42:54,150 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 221 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:54,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 586 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:42:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-25 15:42:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-11-25 15:42:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 89 states have internal predecessors, (104), 46 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2022-11-25 15:42:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2022-11-25 15:42:54,169 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 122 [2022-11-25 15:42:54,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:54,170 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2022-11-25 15:42:54,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-25 15:42:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2022-11-25 15:42:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-25 15:42:54,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:54,172 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 3, 3, 3, 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] [2022-11-25 15:42:54,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:54,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:42:54,383 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:42:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1013982917, now seen corresponding path program 2 times [2022-11-25 15:42:54,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:42:54,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988147361] [2022-11-25 15:42:54,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:54,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:42:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:42:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:42:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:42:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:42:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:42:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 15:42:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 15:42:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:42:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:42:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 15:42:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 15:42:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 15:42:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 15:42:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 15:42:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 15:42:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:42:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 15:42:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-25 15:42:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-11-25 15:42:55,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:42:55,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988147361] [2022-11-25 15:42:55,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988147361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:42:55,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229014267] [2022-11-25 15:42:55,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:42:55,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:42:55,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:42:55,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:42:55,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 15:42:55,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 15:42:55,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:42:55,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 2308 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 15:42:55,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-11-25 15:42:55,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:42:55,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229014267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:55,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:42:55,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-11-25 15:42:55,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695341218] [2022-11-25 15:42:55,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:55,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:42:55,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:42:55,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:42:55,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:42:55,989 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-11-25 15:42:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:56,100 INFO L93 Difference]: Finished difference Result 158 states and 218 transitions. [2022-11-25 15:42:56,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:42:56,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2022-11-25 15:42:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:56,103 INFO L225 Difference]: With dead ends: 158 [2022-11-25 15:42:56,103 INFO L226 Difference]: Without dead ends: 156 [2022-11-25 15:42:56,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-11-25 15:42:56,106 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 17 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:56,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1320 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:42:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-25 15:42:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2022-11-25 15:42:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 96 states have internal predecessors, (110), 47 states have call successors, (47), 12 states have call predecessors, (47), 14 states have return successors, (58), 46 states have call predecessors, (58), 46 states have call successors, (58) [2022-11-25 15:42:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 215 transitions. [2022-11-25 15:42:56,146 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 215 transitions. Word has length 126 [2022-11-25 15:42:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:56,151 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 215 transitions. [2022-11-25 15:42:56,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-11-25 15:42:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 215 transitions. [2022-11-25 15:42:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-25 15:42:56,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:56,159 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 15:42:56,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:56,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:42:56,369 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:42:56,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:56,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1840062733, now seen corresponding path program 1 times [2022-11-25 15:42:56,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:42:56,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474990258] [2022-11-25 15:42:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:56,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:42:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:42:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:56,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:42:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:56,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:42:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:56,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:42:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:42:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 15:42:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 15:42:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:42:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:42:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 15:42:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 15:42:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 15:42:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 15:42:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 15:42:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 15:42:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:42:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 15:42:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-25 15:42:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-11-25 15:42:57,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:42:57,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474990258] [2022-11-25 15:42:57,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474990258] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:42:57,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870642998] [2022-11-25 15:42:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:57,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:42:57,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:42:57,243 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:42:57,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 15:42:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:57,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 2722 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:42:57,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-25 15:42:57,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:42:57,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870642998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:57,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:42:57,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-11-25 15:42:57,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499376951] [2022-11-25 15:42:57,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:57,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:42:57,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:42:57,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:42:57,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:42:57,973 INFO L87 Difference]: Start difference. First operand 155 states and 215 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-25 15:42:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:58,369 INFO L93 Difference]: Finished difference Result 301 states and 428 transitions. [2022-11-25 15:42:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:42:58,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 130 [2022-11-25 15:42:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:58,373 INFO L225 Difference]: With dead ends: 301 [2022-11-25 15:42:58,373 INFO L226 Difference]: Without dead ends: 183 [2022-11-25 15:42:58,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-11-25 15:42:58,374 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 262 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:58,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 670 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:42:58,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-25 15:42:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-25 15:42:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 107 states have (on average 1.1869158878504673) internal successors, (127), 110 states have internal predecessors, (127), 60 states have call successors, (60), 13 states have call predecessors, (60), 15 states have return successors, (73), 59 states have call predecessors, (73), 59 states have call successors, (73) [2022-11-25 15:42:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 260 transitions. [2022-11-25 15:42:58,397 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 260 transitions. Word has length 130 [2022-11-25 15:42:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:58,397 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 260 transitions. [2022-11-25 15:42:58,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-25 15:42:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 260 transitions. [2022-11-25 15:42:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-25 15:42:58,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:58,400 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 4, 3, 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] [2022-11-25 15:42:58,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:58,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:42:58,610 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:42:58,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:58,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1072376014, now seen corresponding path program 1 times [2022-11-25 15:42:58,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:42:58,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55293186] [2022-11-25 15:42:58,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:58,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:42:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:02,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:43:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:02,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:43:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:43:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:02,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:02,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:43:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:43:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:02,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 15:43:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:03,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 15:43:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:43:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:03,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:43:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 15:43:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 15:43:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:03,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 15:43:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:03,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:43:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:03,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:43:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:03,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:43:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:03,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 15:43:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:03,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 15:43:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:03,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:43:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:03,463 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-11-25 15:43:03,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:43:03,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55293186] [2022-11-25 15:43:03,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55293186] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:43:03,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568728475] [2022-11-25 15:43:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:43:03,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:43:03,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:43:03,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:43:03,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 15:43:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:04,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 2727 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-25 15:43:04,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:43:04,181 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2022-11-25 15:43:05,007 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 29 [2022-11-25 15:43:07,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2022-11-25 15:43:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 138 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-25 15:43:07,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:43:10,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568728475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:43:10,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:43:10,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2022-11-25 15:43:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312363596] [2022-11-25 15:43:10,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:43:10,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 15:43:10,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:43:10,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 15:43:10,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2022-11-25 15:43:10,242 INFO L87 Difference]: Start difference. First operand 183 states and 260 transitions. Second operand has 30 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 26 states have internal predecessors, (100), 14 states have call successors, (40), 9 states have call predecessors, (40), 8 states have return successors, (37), 11 states have call predecessors, (37), 13 states have call successors, (37) [2022-11-25 15:43:12,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:16,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:20,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:23,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:24,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:26,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:27,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:30,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:31,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:32,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:34,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:36,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:38,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:39,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:45,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:47,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:53,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:55,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:57,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:43:59,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:08,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:09,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:11,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:13,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:16,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:18,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:24,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:26,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:28,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:30,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:32,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:33,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:36,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:37,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:38,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:40,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:42,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:45,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:47,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:49,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:53,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:55,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:57,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:44:59,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:01,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:03,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:05,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:07,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:09,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:11,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:12,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:13,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:15,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:16,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:18,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:19,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:22,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:23,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:25,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:26,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:28,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:29,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:31,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:32,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:35,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:36,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:38,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:40,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:41,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:43,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:44,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:45,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:46,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:45:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:46,864 INFO L93 Difference]: Finished difference Result 715 states and 1037 transitions. [2022-11-25 15:45:46,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-25 15:45:46,865 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 26 states have internal predecessors, (100), 14 states have call successors, (40), 9 states have call predecessors, (40), 8 states have return successors, (37), 11 states have call predecessors, (37), 13 states have call successors, (37) Word has length 132 [2022-11-25 15:45:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:46,870 INFO L225 Difference]: With dead ends: 715 [2022-11-25 15:45:46,870 INFO L226 Difference]: Without dead ends: 579 [2022-11-25 15:45:46,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 236 SyntacticMatches, 19 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=750, Invalid=6037, Unknown=19, NotChecked=0, Total=6806 [2022-11-25 15:45:46,879 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 827 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 5553 mSolverCounterSat, 714 mSolverCounterUnsat, 131 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 130.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 6398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 714 IncrementalHoareTripleChecker+Valid, 5553 IncrementalHoareTripleChecker+Invalid, 131 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 131.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:46,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 881 Invalid, 6398 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [714 Valid, 5553 Invalid, 131 Unknown, 0 Unchecked, 131.6s Time] [2022-11-25 15:45:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-11-25 15:45:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 524. [2022-11-25 15:45:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 314 states have (on average 1.1719745222929936) internal successors, (368), 321 states have internal predecessors, (368), 167 states have call successors, (167), 39 states have call predecessors, (167), 42 states have return successors, (200), 163 states have call predecessors, (200), 164 states have call successors, (200) [2022-11-25 15:45:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 735 transitions. [2022-11-25 15:45:46,979 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 735 transitions. Word has length 132 [2022-11-25 15:45:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:46,980 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 735 transitions. [2022-11-25 15:45:46,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 26 states have internal predecessors, (100), 14 states have call successors, (40), 9 states have call predecessors, (40), 8 states have return successors, (37), 11 states have call predecessors, (37), 13 states have call successors, (37) [2022-11-25 15:45:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 735 transitions. [2022-11-25 15:45:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-25 15:45:46,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:46,995 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 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] [2022-11-25 15:45:47,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:47,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:47,207 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:45:47,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:47,208 INFO L85 PathProgramCache]: Analyzing trace with hash 836028555, now seen corresponding path program 1 times [2022-11-25 15:45:47,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:47,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426992774] [2022-11-25 15:45:47,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:47,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:50,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:45:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:50,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:45:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:50,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:45:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:50,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:50,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:45:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:50,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:45:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:50,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 15:45:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:50,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 15:45:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:50,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:45:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:50,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:45:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:51,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:45:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:51,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:45:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:51,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 15:45:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:51,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-25 15:45:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:51,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-25 15:45:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-25 15:45:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:51,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 15:45:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:51,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 15:45:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:51,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 15:45:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:51,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-25 15:45:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-11-25 15:45:51,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:51,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426992774] [2022-11-25 15:45:51,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426992774] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:51,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479031896] [2022-11-25 15:45:51,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:51,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:51,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:51,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 15:45:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:52,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 2784 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-25 15:45:52,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:53,074 INFO L321 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2022-11-25 15:45:53,074 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2022-11-25 15:45:53,238 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 15:45:53,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 23 [2022-11-25 15:45:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 128 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-25 15:45:53,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:45:54,028 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 14 [2022-11-25 15:45:54,095 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-25 15:45:54,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2022-11-25 15:45:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-11-25 15:45:54,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479031896] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:45:54,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:45:54,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 11] total 34 [2022-11-25 15:45:54,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536917165] [2022-11-25 15:45:54,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:45:54,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 15:45:54,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:54,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 15:45:54,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 15:45:54,134 INFO L87 Difference]: Start difference. First operand 524 states and 735 transitions. Second operand has 34 states, 30 states have (on average 3.933333333333333) internal successors, (118), 30 states have internal predecessors, (118), 16 states have call successors, (52), 8 states have call predecessors, (52), 10 states have return successors, (49), 13 states have call predecessors, (49), 16 states have call successors, (49) [2022-11-25 15:46:12,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:46:14,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:46:16,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:46:21,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:46:24,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:46:32,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:46:33,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:46:35,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:46:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:42,480 INFO L93 Difference]: Finished difference Result 1150 states and 1650 transitions. [2022-11-25 15:46:42,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-25 15:46:42,481 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 3.933333333333333) internal successors, (118), 30 states have internal predecessors, (118), 16 states have call successors, (52), 8 states have call predecessors, (52), 10 states have return successors, (49), 13 states have call predecessors, (49), 16 states have call successors, (49) Word has length 143 [2022-11-25 15:46:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:42,487 INFO L225 Difference]: With dead ends: 1150 [2022-11-25 15:46:42,487 INFO L226 Difference]: Without dead ends: 934 [2022-11-25 15:46:42,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 310 SyntacticMatches, 10 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=619, Invalid=4637, Unknown=0, NotChecked=0, Total=5256 [2022-11-25 15:46:42,492 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 1106 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 7930 mSolverCounterSat, 1493 mSolverCounterUnsat, 100 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 9523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1493 IncrementalHoareTripleChecker+Valid, 7930 IncrementalHoareTripleChecker+Invalid, 100 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:42,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 1381 Invalid, 9523 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1493 Valid, 7930 Invalid, 100 Unknown, 0 Unchecked, 45.3s Time] [2022-11-25 15:46:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2022-11-25 15:46:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 734. [2022-11-25 15:46:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 447 states have (on average 1.174496644295302) internal successors, (525), 456 states have internal predecessors, (525), 226 states have call successors, (226), 56 states have call predecessors, (226), 60 states have return successors, (271), 221 states have call predecessors, (271), 223 states have call successors, (271) [2022-11-25 15:46:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1022 transitions. [2022-11-25 15:46:42,635 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1022 transitions. Word has length 143 [2022-11-25 15:46:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:42,636 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1022 transitions. [2022-11-25 15:46:42,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 3.933333333333333) internal successors, (118), 30 states have internal predecessors, (118), 16 states have call successors, (52), 8 states have call predecessors, (52), 10 states have return successors, (49), 13 states have call predecessors, (49), 16 states have call successors, (49) [2022-11-25 15:46:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1022 transitions. [2022-11-25 15:46:42,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-25 15:46:42,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:42,640 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 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] [2022-11-25 15:46:42,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:42,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:42,850 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:42,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1639095725, now seen corresponding path program 1 times [2022-11-25 15:46:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:42,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146528697] [2022-11-25 15:46:42,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:42,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:46:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:46:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:46:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:46:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:46:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 15:46:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 15:46:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:46:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:46:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 15:46:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 15:46:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 15:46:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:46:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:46:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:46:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 15:46:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 15:46:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:46:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:46:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-25 15:46:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2022-11-25 15:46:44,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:44,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146528697] [2022-11-25 15:46:44,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146528697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:44,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:44,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 15:46:44,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236473593] [2022-11-25 15:46:44,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:44,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:46:44,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:44,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:46:44,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:46:44,032 INFO L87 Difference]: Start difference. First operand 734 states and 1022 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-11-25 15:46:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:45,213 INFO L93 Difference]: Finished difference Result 768 states and 1063 transitions. [2022-11-25 15:46:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:46:45,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2022-11-25 15:46:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:45,218 INFO L225 Difference]: With dead ends: 768 [2022-11-25 15:46:45,219 INFO L226 Difference]: Without dead ends: 766 [2022-11-25 15:46:45,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:46:45,222 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 159 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:45,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 557 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 15:46:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-11-25 15:46:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 758. [2022-11-25 15:46:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 459 states have (on average 1.1699346405228759) internal successors, (537), 468 states have internal predecessors, (537), 234 states have call successors, (234), 60 states have call predecessors, (234), 64 states have return successors, (279), 229 states have call predecessors, (279), 231 states have call successors, (279) [2022-11-25 15:46:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1050 transitions. [2022-11-25 15:46:45,364 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1050 transitions. Word has length 142 [2022-11-25 15:46:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:45,365 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 1050 transitions. [2022-11-25 15:46:45,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-11-25 15:46:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1050 transitions. [2022-11-25 15:46:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-25 15:46:45,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:45,369 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:45,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:46:45,370 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:45,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1420240004, now seen corresponding path program 1 times [2022-11-25 15:46:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:45,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170826253] [2022-11-25 15:46:45,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:45,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:46:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:46:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:46:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:46:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:46:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 15:46:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 15:46:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:46:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:46:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 15:46:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 15:46:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:46:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 15:46:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 15:46:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 15:46:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:46:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-25 15:46:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 15:46:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:46:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:46:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-25 15:46:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-25 15:46:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-25 15:46:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-25 15:46:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 23 proven. 46 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2022-11-25 15:46:50,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:50,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170826253] [2022-11-25 15:46:50,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170826253] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:50,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943587970] [2022-11-25 15:46:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:50,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:50,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:46:50,595 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:46:50,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 15:46:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:51,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 2835 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-25 15:46:51,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:51,172 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2022-11-25 15:46:52,365 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_636 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ensure_byte_cursor_has_allocated_buffer_member_#in~cursor.base| v_ArrVal_636) |c_#memory_int|)) is different from true [2022-11-25 15:46:52,376 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-25 15:46:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 84 proven. 25 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-11-25 15:46:55,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:46:55,820 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_639 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| v_ArrVal_639) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|))) (<= .cse0 (* 18446744073709551616 (div .cse0 18446744073709551616))))) is different from false [2022-11-25 15:46:55,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943587970] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:55,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:46:55,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 37 [2022-11-25 15:46:55,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134327866] [2022-11-25 15:46:55,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:46:55,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-25 15:46:55,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:55,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-25 15:46:55,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1352, Unknown=2, NotChecked=150, Total=1640 [2022-11-25 15:46:55,825 INFO L87 Difference]: Start difference. First operand 758 states and 1050 transitions. Second operand has 37 states, 33 states have (on average 3.878787878787879) internal successors, (128), 33 states have internal predecessors, (128), 16 states have call successors, (54), 8 states have call predecessors, (54), 10 states have return successors, (51), 12 states have call predecessors, (51), 16 states have call successors, (51) [2022-11-25 15:47:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:05,905 INFO L93 Difference]: Finished difference Result 1162 states and 1628 transitions. [2022-11-25 15:47:05,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-25 15:47:05,905 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 3.878787878787879) internal successors, (128), 33 states have internal predecessors, (128), 16 states have call successors, (54), 8 states have call predecessors, (54), 10 states have return successors, (51), 12 states have call predecessors, (51), 16 states have call successors, (51) Word has length 176 [2022-11-25 15:47:05,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:05,913 INFO L225 Difference]: With dead ends: 1162 [2022-11-25 15:47:05,913 INFO L226 Difference]: Without dead ends: 941 [2022-11-25 15:47:05,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 289 SyntacticMatches, 37 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2234 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=657, Invalid=5793, Unknown=38, NotChecked=318, Total=6806 [2022-11-25 15:47:05,917 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 721 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 5923 mSolverCounterSat, 700 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 7051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 700 IncrementalHoareTripleChecker+Valid, 5923 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:05,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 778 Invalid, 7051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [700 Valid, 5923 Invalid, 28 Unknown, 400 Unchecked, 7.1s Time] [2022-11-25 15:47:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-11-25 15:47:06,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 893. [2022-11-25 15:47:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 542 states have (on average 1.169741697416974) internal successors, (634), 552 states have internal predecessors, (634), 275 states have call successors, (275), 70 states have call predecessors, (275), 75 states have return successors, (329), 270 states have call predecessors, (329), 272 states have call successors, (329) [2022-11-25 15:47:06,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1238 transitions. [2022-11-25 15:47:06,048 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1238 transitions. Word has length 176 [2022-11-25 15:47:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:06,048 INFO L495 AbstractCegarLoop]: Abstraction has 893 states and 1238 transitions. [2022-11-25 15:47:06,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 3.878787878787879) internal successors, (128), 33 states have internal predecessors, (128), 16 states have call successors, (54), 8 states have call predecessors, (54), 10 states have return successors, (51), 12 states have call predecessors, (51), 16 states have call successors, (51) [2022-11-25 15:47:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1238 transitions. [2022-11-25 15:47:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-25 15:47:06,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:06,052 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 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] [2022-11-25 15:47:06,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:06,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 15:47:06,263 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:06,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:06,263 INFO L85 PathProgramCache]: Analyzing trace with hash 910801463, now seen corresponding path program 2 times [2022-11-25 15:47:06,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:06,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190589751] [2022-11-25 15:47:06,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:06,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:47:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:47:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:47:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 15:47:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 15:47:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:47:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:47:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 15:47:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:47:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 15:47:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-25 15:47:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-25 15:47:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-25 15:47:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 15:47:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 15:47:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 15:47:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-25 15:47:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2022-11-25 15:47:07,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:07,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190589751] [2022-11-25 15:47:07,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190589751] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:07,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236451982] [2022-11-25 15:47:07,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:47:07,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:07,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:07,551 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:47:07,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 15:47:08,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:47:08,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:47:08,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 2784 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 15:47:08,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:08,530 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2022-11-25 15:47:09,065 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-25 15:47:09,109 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-25 15:47:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 132 proven. 8 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-25 15:47:09,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:47:09,427 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| v_ArrVal_761) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|) 18446744073709551616) 0)) is different from false [2022-11-25 15:47:09,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236451982] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:09,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:47:09,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2022-11-25 15:47:09,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074650290] [2022-11-25 15:47:09,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:47:09,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 15:47:09,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 15:47:09,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=455, Unknown=1, NotChecked=42, Total=552 [2022-11-25 15:47:09,439 INFO L87 Difference]: Start difference. First operand 893 states and 1238 transitions. Second operand has 21 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 7 states have call successors, (42), 5 states have call predecessors, (42), 7 states have return successors, (39), 6 states have call predecessors, (39), 7 states have call successors, (39) [2022-11-25 15:47:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:14,132 INFO L93 Difference]: Finished difference Result 1188 states and 1650 transitions. [2022-11-25 15:47:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 15:47:14,132 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 7 states have call successors, (42), 5 states have call predecessors, (42), 7 states have return successors, (39), 6 states have call predecessors, (39), 7 states have call successors, (39) Word has length 143 [2022-11-25 15:47:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:14,138 INFO L225 Difference]: With dead ends: 1188 [2022-11-25 15:47:14,139 INFO L226 Difference]: Without dead ends: 964 [2022-11-25 15:47:14,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 261 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=291, Invalid=2262, Unknown=1, NotChecked=98, Total=2652 [2022-11-25 15:47:14,142 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 397 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 3590 mSolverCounterSat, 252 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 3849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 3590 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:14,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 893 Invalid, 3849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 3590 Invalid, 7 Unknown, 0 Unchecked, 3.3s Time] [2022-11-25 15:47:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2022-11-25 15:47:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 924. [2022-11-25 15:47:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 566 states have (on average 1.1660777385159011) internal successors, (660), 577 states have internal predecessors, (660), 275 states have call successors, (275), 76 states have call predecessors, (275), 82 states have return successors, (340), 270 states have call predecessors, (340), 272 states have call successors, (340) [2022-11-25 15:47:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1275 transitions. [2022-11-25 15:47:14,291 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1275 transitions. Word has length 143 [2022-11-25 15:47:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:14,291 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1275 transitions. [2022-11-25 15:47:14,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 7 states have call successors, (42), 5 states have call predecessors, (42), 7 states have return successors, (39), 6 states have call predecessors, (39), 7 states have call successors, (39) [2022-11-25 15:47:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1275 transitions. [2022-11-25 15:47:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-25 15:47:14,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:14,296 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 4, 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] [2022-11-25 15:47:14,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:14,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 15:47:14,511 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:14,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash -269900389, now seen corresponding path program 1 times [2022-11-25 15:47:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:14,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511732576] [2022-11-25 15:47:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:14,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:47:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:47:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:47:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 15:47:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 15:47:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:47:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:47:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 15:47:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 15:47:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 15:47:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:47:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:47:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:47:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 15:47:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 15:47:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:47:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:47:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:17,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-25 15:47:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-11-25 15:47:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:18,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511732576] [2022-11-25 15:47:18,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511732576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:18,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154970029] [2022-11-25 15:47:18,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:18,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:18,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:18,169 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:47:18,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 15:47:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 2757 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 15:47:18,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:18,890 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-25 15:47:18,895 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-25 15:47:19,361 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-25 15:47:19,364 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-25 15:47:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 110 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-25 15:47:19,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:47:20,065 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 24 [2022-11-25 15:47:20,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:47:20,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:47:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-11-25 15:47:20,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154970029] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:47:20,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:47:20,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 12] total 33 [2022-11-25 15:47:20,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60011249] [2022-11-25 15:47:20,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:47:20,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 15:47:20,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:20,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 15:47:20,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 15:47:20,110 INFO L87 Difference]: Start difference. First operand 924 states and 1275 transitions. Second operand has 33 states, 29 states have (on average 4.413793103448276) internal successors, (128), 26 states have internal predecessors, (128), 14 states have call successors, (63), 7 states have call predecessors, (63), 9 states have return successors, (60), 11 states have call predecessors, (60), 12 states have call successors, (60) [2022-11-25 15:47:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:27,059 INFO L93 Difference]: Finished difference Result 1707 states and 2345 transitions. [2022-11-25 15:47:27,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 15:47:27,060 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 4.413793103448276) internal successors, (128), 26 states have internal predecessors, (128), 14 states have call successors, (63), 7 states have call predecessors, (63), 9 states have return successors, (60), 11 states have call predecessors, (60), 12 states have call successors, (60) Word has length 146 [2022-11-25 15:47:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:27,065 INFO L225 Difference]: With dead ends: 1707 [2022-11-25 15:47:27,065 INFO L226 Difference]: Without dead ends: 797 [2022-11-25 15:47:27,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 318 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=295, Invalid=3365, Unknown=0, NotChecked=0, Total=3660 [2022-11-25 15:47:27,071 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 324 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 5055 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 5205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 5055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:27,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1022 Invalid, 5205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 5055 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-25 15:47:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2022-11-25 15:47:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 786. [2022-11-25 15:47:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 482 states have (on average 1.1639004149377594) internal successors, (561), 491 states have internal predecessors, (561), 234 states have call successors, (234), 65 states have call predecessors, (234), 69 states have return successors, (284), 229 states have call predecessors, (284), 231 states have call successors, (284) [2022-11-25 15:47:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1079 transitions. [2022-11-25 15:47:27,199 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1079 transitions. Word has length 146 [2022-11-25 15:47:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:27,200 INFO L495 AbstractCegarLoop]: Abstraction has 786 states and 1079 transitions. [2022-11-25 15:47:27,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 4.413793103448276) internal successors, (128), 26 states have internal predecessors, (128), 14 states have call successors, (63), 7 states have call predecessors, (63), 9 states have return successors, (60), 11 states have call predecessors, (60), 12 states have call successors, (60) [2022-11-25 15:47:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1079 transitions. [2022-11-25 15:47:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-11-25 15:47:27,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:27,204 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-11-25 15:47:27,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:27,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 15:47:27,414 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:27,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:27,414 INFO L85 PathProgramCache]: Analyzing trace with hash 897064719, now seen corresponding path program 1 times [2022-11-25 15:47:27,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:27,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281957133] [2022-11-25 15:47:27,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:27,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:47:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 15:47:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 15:47:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:47:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 15:47:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 15:47:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:47:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:47:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:47:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 15:47:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 15:47:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 15:47:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 15:47:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:47:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 15:47:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-25 15:47:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-25 15:47:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-11-25 15:47:28,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:28,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281957133] [2022-11-25 15:47:28,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281957133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:28,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541900357] [2022-11-25 15:47:28,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:28,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:28,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:28,688 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:47:28,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 15:47:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:29,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 2838 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:47:29,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-25 15:47:29,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:47:29,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541900357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:29,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:47:29,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-11-25 15:47:29,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578196878] [2022-11-25 15:47:29,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:29,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:47:29,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:29,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:47:29,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:47:29,514 INFO L87 Difference]: Start difference. First operand 786 states and 1079 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 15:47:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:30,091 INFO L93 Difference]: Finished difference Result 1448 states and 2019 transitions. [2022-11-25 15:47:30,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:47:30,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 160 [2022-11-25 15:47:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:30,097 INFO L225 Difference]: With dead ends: 1448 [2022-11-25 15:47:30,097 INFO L226 Difference]: Without dead ends: 789 [2022-11-25 15:47:30,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-11-25 15:47:30,101 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 19 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:30,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 682 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:47:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-11-25 15:47:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 786. [2022-11-25 15:47:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 482 states have (on average 1.1535269709543567) internal successors, (556), 491 states have internal predecessors, (556), 234 states have call successors, (234), 65 states have call predecessors, (234), 69 states have return successors, (284), 229 states have call predecessors, (284), 231 states have call successors, (284) [2022-11-25 15:47:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1074 transitions. [2022-11-25 15:47:30,227 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1074 transitions. Word has length 160 [2022-11-25 15:47:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:30,227 INFO L495 AbstractCegarLoop]: Abstraction has 786 states and 1074 transitions. [2022-11-25 15:47:30,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 15:47:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1074 transitions. [2022-11-25 15:47:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-11-25 15:47:30,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:30,232 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-11-25 15:47:30,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:30,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 15:47:30,447 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:30,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash 404438545, now seen corresponding path program 1 times [2022-11-25 15:47:30,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:30,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879201546] [2022-11-25 15:47:30,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:30,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:47:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 15:47:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 15:47:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:47:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 15:47:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 15:47:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:47:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:47:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:47:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 15:47:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 15:47:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 15:47:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 15:47:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:47:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 15:47:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-25 15:47:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-25 15:47:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-11-25 15:47:31,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:31,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879201546] [2022-11-25 15:47:31,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879201546] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:31,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222926809] [2022-11-25 15:47:31,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:31,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:31,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:31,659 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:47:31,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 15:47:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:32,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 2843 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 15:47:32,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:32,393 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-25 15:47:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-11-25 15:47:32,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:47:32,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222926809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:32,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:47:32,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [12] total 24 [2022-11-25 15:47:32,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584340520] [2022-11-25 15:47:32,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:32,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 15:47:32,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:32,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 15:47:32,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2022-11-25 15:47:32,798 INFO L87 Difference]: Start difference. First operand 786 states and 1074 transitions. Second operand has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 11 states have internal predecessors, (71), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 5 states have call successors, (22) [2022-11-25 15:47:35,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:47:37,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:47:39,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:47:41,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:47:43,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:47:45,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:47:48,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:47:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:48,991 INFO L93 Difference]: Finished difference Result 1627 states and 2229 transitions. [2022-11-25 15:47:48,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 15:47:48,992 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 11 states have internal predecessors, (71), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 5 states have call successors, (22) Word has length 160 [2022-11-25 15:47:48,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:48,999 INFO L225 Difference]: With dead ends: 1627 [2022-11-25 15:47:48,999 INFO L226 Difference]: Without dead ends: 1073 [2022-11-25 15:47:49,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 15:47:49,003 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 208 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 69 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:49,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1950 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 972 Invalid, 7 Unknown, 0 Unchecked, 15.7s Time] [2022-11-25 15:47:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2022-11-25 15:47:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1036. [2022-11-25 15:47:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 644 states have (on average 1.156832298136646) internal successors, (745), 656 states have internal predecessors, (745), 302 states have call successors, (302), 82 states have call predecessors, (302), 89 states have return successors, (365), 297 states have call predecessors, (365), 298 states have call successors, (365) [2022-11-25 15:47:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1412 transitions. [2022-11-25 15:47:49,177 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1412 transitions. Word has length 160 [2022-11-25 15:47:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:49,177 INFO L495 AbstractCegarLoop]: Abstraction has 1036 states and 1412 transitions. [2022-11-25 15:47:49,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 11 states have internal predecessors, (71), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 5 states have call successors, (22) [2022-11-25 15:47:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1412 transitions. [2022-11-25 15:47:49,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-11-25 15:47:49,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:49,182 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 15:47:49,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:49,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 15:47:49,392 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:49,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1266272147, now seen corresponding path program 1 times [2022-11-25 15:47:49,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:49,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606695822] [2022-11-25 15:47:49,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:49,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:52,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:52,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:47:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:52,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:52,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:52,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:52,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 15:47:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:52,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 15:47:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:52,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:47:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:52,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 15:47:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:52,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 15:47:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:53,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:47:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:53,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:47:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:53,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:47:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:53,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 15:47:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 15:47:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:53,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 15:47:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:53,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 15:47:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:53,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:47:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:53,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 15:47:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:53,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-25 15:47:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:53,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-25 15:47:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-11-25 15:47:53,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:53,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606695822] [2022-11-25 15:47:53,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606695822] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:53,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061109943] [2022-11-25 15:47:53,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:53,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:53,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:53,721 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:47:53,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 15:47:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:54,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 2838 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:47:54,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-11-25 15:47:54,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:47:54,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061109943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:54,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:47:54,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [27] total 29 [2022-11-25 15:47:54,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000044685] [2022-11-25 15:47:54,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:54,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:47:54,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:54,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:47:54,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-11-25 15:47:54,519 INFO L87 Difference]: Start difference. First operand 1036 states and 1412 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 15:47:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:54,995 INFO L93 Difference]: Finished difference Result 1936 states and 2688 transitions. [2022-11-25 15:47:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:47:54,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 160 [2022-11-25 15:47:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:55,001 INFO L225 Difference]: With dead ends: 1936 [2022-11-25 15:47:55,001 INFO L226 Difference]: Without dead ends: 1034 [2022-11-25 15:47:55,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2022-11-25 15:47:55,006 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 9 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:55,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 505 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:47:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-11-25 15:47:55,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2022-11-25 15:47:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 642 states have (on average 1.1433021806853583) internal successors, (734), 654 states have internal predecessors, (734), 302 states have call successors, (302), 82 states have call predecessors, (302), 89 states have return successors, (365), 297 states have call predecessors, (365), 298 states have call successors, (365) [2022-11-25 15:47:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1401 transitions. [2022-11-25 15:47:55,159 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1401 transitions. Word has length 160 [2022-11-25 15:47:55,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:55,159 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1401 transitions. [2022-11-25 15:47:55,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 15:47:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1401 transitions. [2022-11-25 15:47:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-25 15:47:55,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:55,164 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-11-25 15:47:55,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:55,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:55,375 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:55,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1282513898, now seen corresponding path program 2 times [2022-11-25 15:47:55,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:55,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073265643] [2022-11-25 15:47:55,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:58,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:58,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:47:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:58,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:58,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 15:47:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:47:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 15:47:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:47:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:47:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 15:47:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:47:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:47:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-25 15:47:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-25 15:47:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-25 15:47:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 15:47:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 15:47:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:47:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-25 15:47:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 15:47:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-11-25 15:47:59,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:59,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073265643] [2022-11-25 15:47:59,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073265643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:59,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394456389] [2022-11-25 15:47:59,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:47:59,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:59,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:59,751 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:47:59,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 15:48:00,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:48:00,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:48:00,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 2853 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 15:48:00,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:48:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 161 proven. 13 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-25 15:48:19,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:48:20,472 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-25 15:48:20,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-11-25 15:48:20,484 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-25 15:48:20,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 15:48:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-11-25 15:48:20,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394456389] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:48:20,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:48:20,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 11] total 46 [2022-11-25 15:48:20,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481907438] [2022-11-25 15:48:20,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:48:20,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-25 15:48:20,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:20,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-25 15:48:20,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1915, Unknown=1, NotChecked=0, Total=2070 [2022-11-25 15:48:20,544 INFO L87 Difference]: Start difference. First operand 1034 states and 1401 transitions. Second operand has 46 states, 43 states have (on average 3.883720930232558) internal successors, (167), 40 states have internal predecessors, (167), 15 states have call successors, (66), 8 states have call predecessors, (66), 11 states have return successors, (62), 14 states have call predecessors, (62), 14 states have call successors, (62) [2022-11-25 15:48:23,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:48:33,475 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:48:43,611 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:48:45,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:48:50,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:48:52,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:48:54,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:48:56,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:48:58,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:49:00,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:49:04,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:49:07,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:49:09,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:49:11,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:49:17,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:49:25,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:49:27,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:49:33,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:49:35,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:49:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:49:51,974 INFO L93 Difference]: Finished difference Result 2346 states and 3289 transitions. [2022-11-25 15:49:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-25 15:49:51,975 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 3.883720930232558) internal successors, (167), 40 states have internal predecessors, (167), 15 states have call successors, (66), 8 states have call predecessors, (66), 11 states have return successors, (62), 14 states have call predecessors, (62), 14 states have call successors, (62) Word has length 162 [2022-11-25 15:49:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:49:51,981 INFO L225 Difference]: With dead ends: 2346 [2022-11-25 15:49:51,981 INFO L226 Difference]: Without dead ends: 1621 [2022-11-25 15:49:51,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 351 SyntacticMatches, 15 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3584 ImplicationChecksByTransitivity, 57.6s TimeCoverageRelationStatistics Valid=1551, Invalid=11098, Unknown=7, NotChecked=0, Total=12656 [2022-11-25 15:49:51,988 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 1017 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 14346 mSolverCounterSat, 1851 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 16214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1851 IncrementalHoareTripleChecker+Valid, 14346 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:49:51,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 2343 Invalid, 16214 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1851 Valid, 14346 Invalid, 17 Unknown, 0 Unchecked, 52.3s Time] [2022-11-25 15:49:51,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-11-25 15:49:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1458. [2022-11-25 15:49:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 887 states have (on average 1.1375422773393462) internal successors, (1009), 899 states have internal predecessors, (1009), 462 states have call successors, (462), 98 states have call predecessors, (462), 108 states have return successors, (565), 460 states have call predecessors, (565), 456 states have call successors, (565) [2022-11-25 15:49:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2036 transitions. [2022-11-25 15:49:52,230 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2036 transitions. Word has length 162 [2022-11-25 15:49:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:49:52,231 INFO L495 AbstractCegarLoop]: Abstraction has 1458 states and 2036 transitions. [2022-11-25 15:49:52,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 3.883720930232558) internal successors, (167), 40 states have internal predecessors, (167), 15 states have call successors, (66), 8 states have call predecessors, (66), 11 states have return successors, (62), 14 states have call predecessors, (62), 14 states have call successors, (62) [2022-11-25 15:49:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2036 transitions. [2022-11-25 15:49:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-25 15:49:52,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:49:52,236 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 3, 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] [2022-11-25 15:49:52,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 15:49:52,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:49:52,446 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:49:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:49:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash -990153401, now seen corresponding path program 1 times [2022-11-25 15:49:52,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:49:52,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478107454] [2022-11-25 15:49:52,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:49:52,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:49:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:52,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:49:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:52,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:49:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:52,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:49:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:52,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:52,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:49:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 15:49:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 15:49:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:49:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 15:49:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:49:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:49:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 15:49:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 15:49:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:49:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 15:49:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 15:49:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:49:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 15:49:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:49:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 15:49:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 15:49:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:49:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 15:49:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-11-25 15:49:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:49:53,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478107454] [2022-11-25 15:49:53,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478107454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:49:53,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:49:53,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:49:53,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59095585] [2022-11-25 15:49:53,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:49:53,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:49:53,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:49:53,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:49:53,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:49:53,163 INFO L87 Difference]: Start difference. First operand 1458 states and 2036 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-11-25 15:49:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:49:53,984 INFO L93 Difference]: Finished difference Result 2404 states and 3308 transitions. [2022-11-25 15:49:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:49:53,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2022-11-25 15:49:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:49:53,994 INFO L225 Difference]: With dead ends: 2404 [2022-11-25 15:49:53,994 INFO L226 Difference]: Without dead ends: 1506 [2022-11-25 15:49:53,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:49:53,998 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 202 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:49:53,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 283 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 15:49:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2022-11-25 15:49:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1494. [2022-11-25 15:49:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 914 states have (on average 1.1334792122538293) internal successors, (1036), 926 states have internal predecessors, (1036), 462 states have call successors, (462), 98 states have call predecessors, (462), 117 states have return successors, (574), 469 states have call predecessors, (574), 456 states have call successors, (574) [2022-11-25 15:49:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2072 transitions. [2022-11-25 15:49:54,277 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2072 transitions. Word has length 164 [2022-11-25 15:49:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:49:54,278 INFO L495 AbstractCegarLoop]: Abstraction has 1494 states and 2072 transitions. [2022-11-25 15:49:54,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-11-25 15:49:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2072 transitions. [2022-11-25 15:49:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-11-25 15:49:54,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:49:54,282 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 3, 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] [2022-11-25 15:49:54,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:49:54,283 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:49:54,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:49:54,283 INFO L85 PathProgramCache]: Analyzing trace with hash 314805478, now seen corresponding path program 1 times [2022-11-25 15:49:54,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:49:54,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658957119] [2022-11-25 15:49:54,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:49:54,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:49:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:59,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:49:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:59,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:49:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:59,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:49:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:59,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:49:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:59,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:59,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 15:49:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 15:50:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:50:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 15:50:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:50:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:50:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 15:50:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:50:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 15:50:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:50:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 15:50:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 15:50:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:50:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 15:50:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:50:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 15:50:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 15:50:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:50:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 15:50:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 7 proven. 87 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-11-25 15:50:00,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:00,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658957119] [2022-11-25 15:50:00,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658957119] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:50:00,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836956134] [2022-11-25 15:50:00,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:00,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:50:00,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:50:00,699 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:50:00,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 15:50:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:01,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 2813 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 15:50:01,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:50:01,365 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2022-11-25 15:50:01,478 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-25 15:50:02,514 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 29 [2022-11-25 15:50:04,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-11-25 15:50:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-25 15:50:04,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:50:06,501 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 6 [2022-11-25 15:50:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-25 15:50:06,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836956134] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:50:06,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:50:06,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 22, 16] total 61 [2022-11-25 15:50:06,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228906938] [2022-11-25 15:50:06,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:50:06,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-25 15:50:06,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:06,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-25 15:50:06,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=3392, Unknown=1, NotChecked=0, Total=3660 [2022-11-25 15:50:06,530 INFO L87 Difference]: Start difference. First operand 1494 states and 2072 transitions. Second operand has 61 states, 49 states have (on average 3.183673469387755) internal successors, (156), 50 states have internal predecessors, (156), 25 states have call successors, (64), 10 states have call predecessors, (64), 15 states have return successors, (62), 19 states have call predecessors, (62), 23 states have call successors, (62) [2022-11-25 15:50:16,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:50:22,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:50:31,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:50:32,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:50:34,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:50:38,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:50:44,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:50:46,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:50:47,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:50:48,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:50:50,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:50:52,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:50:58,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:51:01,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:51:03,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:51:06,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:51:16,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:51:18,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:51:19,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:51:21,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:51:28,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:51:30,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:51:31,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:51:37,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:51:39,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:51:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:39,753 INFO L93 Difference]: Finished difference Result 1559 states and 2143 transitions. [2022-11-25 15:51:39,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-25 15:51:39,755 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 49 states have (on average 3.183673469387755) internal successors, (156), 50 states have internal predecessors, (156), 25 states have call successors, (64), 10 states have call predecessors, (64), 15 states have return successors, (62), 19 states have call predecessors, (62), 23 states have call successors, (62) Word has length 165 [2022-11-25 15:51:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:39,763 INFO L225 Difference]: With dead ends: 1559 [2022-11-25 15:51:39,763 INFO L226 Difference]: Without dead ends: 1554 [2022-11-25 15:51:39,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 348 SyntacticMatches, 8 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=1303, Invalid=15442, Unknown=25, NotChecked=0, Total=16770 [2022-11-25 15:51:39,768 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 676 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 8477 mSolverCounterSat, 611 mSolverCounterUnsat, 61 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 9149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 8477 IncrementalHoareTripleChecker+Invalid, 61 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:39,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1270 Invalid, 9149 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [611 Valid, 8477 Invalid, 61 Unknown, 0 Unchecked, 49.7s Time] [2022-11-25 15:51:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2022-11-25 15:51:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1495. [2022-11-25 15:51:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 916 states have (on average 1.1320960698689957) internal successors, (1037), 927 states have internal predecessors, (1037), 460 states have call successors, (460), 99 states have call predecessors, (460), 118 states have return successors, (572), 468 states have call predecessors, (572), 454 states have call successors, (572) [2022-11-25 15:51:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 2069 transitions. [2022-11-25 15:51:40,007 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 2069 transitions. Word has length 165 [2022-11-25 15:51:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:40,008 INFO L495 AbstractCegarLoop]: Abstraction has 1495 states and 2069 transitions. [2022-11-25 15:51:40,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 49 states have (on average 3.183673469387755) internal successors, (156), 50 states have internal predecessors, (156), 25 states have call successors, (64), 10 states have call predecessors, (64), 15 states have return successors, (62), 19 states have call predecessors, (62), 23 states have call successors, (62) [2022-11-25 15:51:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2069 transitions. [2022-11-25 15:51:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-25 15:51:40,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:40,012 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 15:51:40,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-25 15:51:40,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 15:51:40,222 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:51:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1805441955, now seen corresponding path program 1 times [2022-11-25 15:51:40,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:40,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612411258] [2022-11-25 15:51:40,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:40,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:51:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:51:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:51:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:51:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:51:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 15:51:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:51:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 15:51:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:51:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:51:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:51:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:51:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:51:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-25 15:51:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-25 15:51:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-25 15:51:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 15:51:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 15:51:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:51:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-25 15:51:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 15:51:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-11-25 15:51:41,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:41,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612411258] [2022-11-25 15:51:41,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612411258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:41,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:41,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 15:51:41,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387362177] [2022-11-25 15:51:41,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:41,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 15:51:41,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:41,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 15:51:41,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:51:41,570 INFO L87 Difference]: Start difference. First operand 1495 states and 2069 transitions. Second operand has 16 states, 15 states have (on average 4.266666666666667) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) [2022-11-25 15:51:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:43,543 INFO L93 Difference]: Finished difference Result 1531 states and 2124 transitions. [2022-11-25 15:51:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 15:51:43,544 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.266666666666667) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) Word has length 164 [2022-11-25 15:51:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:43,553 INFO L225 Difference]: With dead ends: 1531 [2022-11-25 15:51:43,553 INFO L226 Difference]: Without dead ends: 1529 [2022-11-25 15:51:43,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2022-11-25 15:51:43,554 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 120 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:43,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 935 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-25 15:51:43,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2022-11-25 15:51:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1499. [2022-11-25 15:51:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 919 states have (on average 1.131664853101197) internal successors, (1040), 930 states have internal predecessors, (1040), 460 states have call successors, (460), 100 states have call predecessors, (460), 119 states have return successors, (572), 468 states have call predecessors, (572), 454 states have call successors, (572) [2022-11-25 15:51:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2072 transitions. [2022-11-25 15:51:43,867 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2072 transitions. Word has length 164 [2022-11-25 15:51:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:43,869 INFO L495 AbstractCegarLoop]: Abstraction has 1499 states and 2072 transitions. [2022-11-25 15:51:43,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.266666666666667) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) [2022-11-25 15:51:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2072 transitions. [2022-11-25 15:51:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-25 15:51:43,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:43,881 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 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] [2022-11-25 15:51:43,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 15:51:43,881 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:51:43,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash 77352560, now seen corresponding path program 1 times [2022-11-25 15:51:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:43,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785738905] [2022-11-25 15:51:43,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:43,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:46,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:46,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:51:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:46,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:51:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:46,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:51:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:46,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:51:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:51:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 15:51:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:51:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 15:51:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:51:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:51:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:51:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:51:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:51:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 15:51:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-25 15:51:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 15:51:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-25 15:51:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 15:51:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:51:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-25 15:51:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-25 15:51:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-25 15:51:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-25 15:51:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 39 proven. 24 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-11-25 15:51:47,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:47,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785738905] [2022-11-25 15:51:47,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785738905] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:51:47,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272848485] [2022-11-25 15:51:47,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:47,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:51:47,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:51:47,887 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:51:47,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6631d6e3-c782-45d0-9aed-f43fe3e7a1b4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 15:51:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:48,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 2861 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-25 15:51:48,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:51:48,546 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2022-11-25 15:51:48,802 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-25 15:51:58,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 18 [2022-11-25 15:51:58,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:51:58,535 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 19 [2022-11-25 15:51:58,702 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1703 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_1703) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1704 (Array Int Int))) (= (store |c_old(#memory_int)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_1704) |c_#memory_int|))) is different from true [2022-11-25 15:51:58,707 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-25 15:51:58,709 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-25 15:51:58,725 WARN L859 $PredicateComparison]: unable to prove that (exists ((|save_byte_from_array_~storage#1.base| Int)) (and (exists ((v_ArrVal_1705 (Array Int Int))) (= (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_1705) |c_#memory_int|)) (exists ((v_ArrVal_1706 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| v_ArrVal_1706) |c_#memory_$Pointer$.base|)))) is different from true [2022-11-25 15:51:58,759 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:51:58,760 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 17 treesize of output 23 [2022-11-25 15:51:58,780 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:51:58,780 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 17 treesize of output 23 [2022-11-25 15:51:58,801 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 4 [2022-11-25 15:51:58,806 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 6 [2022-11-25 15:53:33,545 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_52| Int)) (not (= (mod (select (select |c_#memory_int| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_52|) 0) 18446744073709551616) 0))) (exists ((|v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_7|) 8) 0)))) is different from true [2022-11-25 15:53:35,752 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_53| Int)) (not (= (mod (select (select |c_#memory_int| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_53|) 0) 18446744073709551616) 0))) (exists ((|v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_8|) 8) 0)))) is different from true [2022-11-25 15:53:37,982 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_9| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_9|) 8) 0))) (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_54| Int)) (not (= (mod (select (select |c_#memory_int| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_54|) 0) 18446744073709551616) 0)))) is different from true [2022-11-25 15:53:40,226 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_10| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_10|) 8) 0))) (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_55| Int)) (not (= (mod (select (select |c_#memory_int| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)))) is different from true [2022-11-25 15:53:42,417 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_11| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_11|) 8) 0))) (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_56| Int)) (not (= (mod (select (select |c_#memory_int| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)))) is different from true [2022-11-25 15:54:29,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:54:29,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 15:54:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 121 proven. 51 refuted. 0 times theorem prover too weak. 29 trivial. 102 not checked. [2022-11-25 15:54:34,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:54:49,561 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int)) (|v_save_byte_from_array_~storage#1.base_63| Int) (v_ArrVal_1713 (Array Int Int))) (or (not (= (mod (select (select (store |c_#memory_int| |v_save_byte_from_array_~storage#1.base_63| v_ArrVal_1714) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|) 18446744073709551616) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_save_byte_from_array_~storage#1.base_63| v_ArrVal_1713) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| 8)) 0)))) is different from false [2022-11-25 15:54:49,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272848485] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:54:49,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:54:49,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 35] total 63 [2022-11-25 15:54:49,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967589828] [2022-11-25 15:54:49,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:54:49,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-25 15:54:49,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:54:49,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-25 15:54:49,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4302, Unknown=28, NotChecked=1112, Total=5700 [2022-11-25 15:54:49,567 INFO L87 Difference]: Start difference. First operand 1499 states and 2072 transitions. Second operand has 63 states, 59 states have (on average 2.8135593220338984) internal successors, (166), 54 states have internal predecessors, (166), 21 states have call successors, (51), 16 states have call predecessors, (51), 22 states have return successors, (48), 20 states have call predecessors, (48), 19 states have call successors, (48) [2022-11-25 15:54:53,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:59,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:01,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:07,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:13,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:20,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:22,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:27,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:30,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:32,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:36,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:38,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:02,513 WARN L233 SmtUtils]: Spent 20.10s on a formula simplification. DAG size of input: 47 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:56:04,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:06,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:09,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:11,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:21,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:23,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:25,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:33,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:35,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:37,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:39,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:42,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:44,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:46,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]