./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/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_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/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_df5d33c8-6958-4f46-a298-9ede48d275da/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 d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd --- 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 18:06:39,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:06:39,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:06:39,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:06:39,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:06:39,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:06:39,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:06:39,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:06:39,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:06:39,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:06:39,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:06:39,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:06:39,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:06:39,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:06:39,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:06:39,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:06:39,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:06:39,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:06:39,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:06:39,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:06:39,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:06:39,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:06:39,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:06:39,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:06:39,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:06:39,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:06:39,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:06:39,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:06:39,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:06:39,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:06:39,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:06:39,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:06:39,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:06:39,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:06:39,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:06:39,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:06:39,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:06:39,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:06:39,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:06:39,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:06:39,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:06:39,135 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 18:06:39,162 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:06:39,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:06:39,163 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:06:39,163 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:06:39,164 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:06:39,164 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:06:39,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:06:39,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:06:39,165 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:06:39,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:06:39,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:06:39,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:06:39,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:06:39,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:06:39,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:06:39,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:06:39,168 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:06:39,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:06:39,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:06:39,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:06:39,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:06:39,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:06:39,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:06:39,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:06:39,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:06:39,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:06:39,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:06:39,171 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:06:39,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:06:39,171 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:06:39,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:06:39,172 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_df5d33c8-6958-4f46-a298-9ede48d275da/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_df5d33c8-6958-4f46-a298-9ede48d275da/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 -> d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd [2022-11-25 18:06:39,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:06:39,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:06:39,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:06:39,507 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:06:39,507 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:06:39,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-11-25 18:06:42,941 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:06:43,732 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:06:43,737 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-11-25 18:06:43,793 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/data/18e64f892/caca851c520b4604990d304fae374bb4/FLAGfe9c75cff [2022-11-25 18:06:43,810 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/data/18e64f892/caca851c520b4604990d304fae374bb4 [2022-11-25 18:06:43,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:06:43,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:06:43,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:06:43,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:06:43,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:06:43,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:06:43" (1/1) ... [2022-11-25 18:06:43,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@529516d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:43, skipping insertion in model container [2022-11-25 18:06:43,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:06:43" (1/1) ... [2022-11-25 18:06:43,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:06:43,971 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:06:44,341 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_df5d33c8-6958-4f46-a298-9ede48d275da/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2022-11-25 18:06:44,357 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_df5d33c8-6958-4f46-a298-9ede48d275da/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2022-11-25 18:06:45,841 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:45,842 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:45,843 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:45,844 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:45,846 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:45,864 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:45,865 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:45,867 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:45,868 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:46,012 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:06:46,013 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:06:46,014 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:06:46,021 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:06:46,024 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:06:46,025 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:06:46,563 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:06:46,564 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:06:46,566 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:06:46,568 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:06:46,569 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:06:46,571 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:06:46,572 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:06:46,573 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:06:46,574 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:06:46,575 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:06:46,576 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:06:46,929 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 18:06:46,976 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 18:06:46,989 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:06:47,026 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:06:47,037 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:47,037 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:47,110 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 18:06:47,117 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:06:47,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:06:47,257 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:06:47,291 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_df5d33c8-6958-4f46-a298-9ede48d275da/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2022-11-25 18:06:47,292 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_df5d33c8-6958-4f46-a298-9ede48d275da/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2022-11-25 18:06:47,364 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:47,377 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:47,378 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:47,378 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:47,379 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:47,393 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:47,400 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:47,401 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:47,404 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:47,411 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:06:47,412 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:06:47,413 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:06:47,418 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:06:47,419 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:06:47,420 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:06:47,462 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:06:47,471 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:06:47,474 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:06:47,475 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:06:47,476 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:06:47,477 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:06:47,478 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:06:47,478 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:06:47,479 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:06:47,480 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:06:47,480 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:06:47,509 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 18:06:47,558 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 18:06:47,577 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:06:47,598 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:06:47,609 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:47,610 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:06:47,705 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 18:06:47,711 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:06:47,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:06:48,028 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:06:48,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:48 WrapperNode [2022-11-25 18:06:48,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:06:48,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:06:48,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:06:48,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:06:48,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:48" (1/1) ... [2022-11-25 18:06:48,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:48" (1/1) ... [2022-11-25 18:06:48,352 INFO L138 Inliner]: procedures = 690, calls = 2734, calls flagged for inlining = 62, calls inlined = 9, statements flattened = 811 [2022-11-25 18:06:48,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:06:48,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:06:48,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:06:48,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:06:48,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:48" (1/1) ... [2022-11-25 18:06:48,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:48" (1/1) ... [2022-11-25 18:06:48,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:48" (1/1) ... [2022-11-25 18:06:48,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:48" (1/1) ... [2022-11-25 18:06:48,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:48" (1/1) ... [2022-11-25 18:06:48,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:48" (1/1) ... [2022-11-25 18:06:48,420 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:48" (1/1) ... [2022-11-25 18:06:48,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:48" (1/1) ... [2022-11-25 18:06:48,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:06:48,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:06:48,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:06:48,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:06:48,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:48" (1/1) ... [2022-11-25 18:06:48,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:06:48,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:06:48,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:06:48,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:06:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-11-25 18:06:48,547 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-11-25 18:06:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:06:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-25 18:06:48,548 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-25 18:06:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-11-25 18:06:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-11-25 18:06:48,549 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-11-25 18:06:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-25 18:06:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-25 18:06:48,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:06:48,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-25 18:06:48,550 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-25 18:06:48,550 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-25 18:06:48,550 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-25 18:06:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 18:06:48,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 18:06:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:06:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:06:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:06:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:06:48,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:06:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-25 18:06:48,553 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-25 18:06:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-25 18:06:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-25 18:06:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-11-25 18:06:48,554 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-11-25 18:06:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 18:06:48,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 18:06:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-11-25 18:06:48,554 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-11-25 18:06:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:06:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-11-25 18:06:48,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-11-25 18:06:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:06:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-11-25 18:06:48,555 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-11-25 18:06:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-25 18:06:48,556 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-25 18:06:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-11-25 18:06:48,556 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-11-25 18:06:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-25 18:06:48,556 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-25 18:06:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:06:48,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-11-25 18:06:48,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:06:48,985 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:06:48,995 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:06:49,282 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-11-25 18:06:50,607 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:06:50,626 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:06:50,626 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:06:50,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:06:50 BoogieIcfgContainer [2022-11-25 18:06:50,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:06:50,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:06:50,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:06:50,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:06:50,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:06:43" (1/3) ... [2022-11-25 18:06:50,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac406fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:06:50, skipping insertion in model container [2022-11-25 18:06:50,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:48" (2/3) ... [2022-11-25 18:06:50,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac406fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:06:50, skipping insertion in model container [2022-11-25 18:06:50,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:06:50" (3/3) ... [2022-11-25 18:06:50,656 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_c_str_harness.i [2022-11-25 18:06:50,680 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:06:50,685 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:06:50,764 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:06:50,771 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;@52e8a0b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:06:50,772 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:06:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-11-25 18:06:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 18:06:50,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:50,797 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:50,798 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:06:50,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:50,808 INFO L85 PathProgramCache]: Analyzing trace with hash -555983859, now seen corresponding path program 1 times [2022-11-25 18:06:50,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:50,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058391562] [2022-11-25 18:06:50,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:50,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:51,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:06:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:51,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:06:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:51,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:06:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:51,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:06:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:06:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:51,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:06:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:51,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:06:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:51,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:06:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:51,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:06:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:51,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:06:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:51,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:06:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:52,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:06:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-25 18:06:52,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:52,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058391562] [2022-11-25 18:06:52,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058391562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:52,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:52,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:06:52,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678421110] [2022-11-25 18:06:52,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:52,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:06:52,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:52,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:06:52,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:06:52,098 INFO L87 Difference]: Start difference. First operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 18:06:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:52,916 INFO L93 Difference]: Finished difference Result 283 states and 370 transitions. [2022-11-25 18:06:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:06:52,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 74 [2022-11-25 18:06:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:52,937 INFO L225 Difference]: With dead ends: 283 [2022-11-25 18:06:52,937 INFO L226 Difference]: Without dead ends: 147 [2022-11-25 18:06:52,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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 18:06:52,959 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 102 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:52,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 146 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:06:52,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-25 18:06:53,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2022-11-25 18:06:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.15) internal successors, (92), 81 states have internal predecessors, (92), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-11-25 18:06:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-11-25 18:06:53,088 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 74 [2022-11-25 18:06:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:53,089 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-11-25 18:06:53,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 18:06:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-11-25 18:06:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 18:06:53,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:53,096 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:53,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:06:53,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:06:53,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:53,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1001240943, now seen corresponding path program 1 times [2022-11-25 18:06:53,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:53,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176321425] [2022-11-25 18:06:53,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:53,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:53,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:06:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:53,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:06:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:53,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:06:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:53,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:06:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:53,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:06:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:53,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:06:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:53,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:06:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:54,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:06:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:54,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:06:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:54,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:06:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:54,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:06:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:54,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:06:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-25 18:06:54,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:54,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176321425] [2022-11-25 18:06:54,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176321425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:54,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:54,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:06:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784776296] [2022-11-25 18:06:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:54,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:06:54,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:54,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:06:54,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:06:54,273 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-25 18:06:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:55,339 INFO L93 Difference]: Finished difference Result 196 states and 238 transitions. [2022-11-25 18:06:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:06:55,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2022-11-25 18:06:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:55,342 INFO L225 Difference]: With dead ends: 196 [2022-11-25 18:06:55,343 INFO L226 Difference]: Without dead ends: 152 [2022-11-25 18:06:55,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:06:55,344 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 104 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:55,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 330 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 18:06:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-25 18:06:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 135. [2022-11-25 18:06:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 85 states have internal predecessors, (96), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (34), 34 states have call predecessors, (34), 33 states have call successors, (34) [2022-11-25 18:06:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2022-11-25 18:06:55,366 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 74 [2022-11-25 18:06:55,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:55,366 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2022-11-25 18:06:55,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-25 18:06:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2022-11-25 18:06:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-25 18:06:55,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:55,369 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:55,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:06:55,370 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:06:55,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:55,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1994019405, now seen corresponding path program 1 times [2022-11-25 18:06:55,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:55,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327670779] [2022-11-25 18:06:55,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:55,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:06:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:06:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:06:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:06:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:06:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:06:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:06:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:06:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:06:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:06:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:06:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:06:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:06:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-25 18:06:56,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:56,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327670779] [2022-11-25 18:06:56,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327670779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:56,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:56,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:06:56,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218152564] [2022-11-25 18:06:56,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:56,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:06:56,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:56,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:06:56,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:06:56,494 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-25 18:06:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:57,818 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2022-11-25 18:06:57,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:06:57,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 80 [2022-11-25 18:06:57,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:57,821 INFO L225 Difference]: With dead ends: 217 [2022-11-25 18:06:57,821 INFO L226 Difference]: Without dead ends: 178 [2022-11-25 18:06:57,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:06:57,823 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 188 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:57,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 415 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 18:06:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-25 18:06:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 140. [2022-11-25 18:06:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 89 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 35 states have call predecessors, (35), 33 states have call successors, (35) [2022-11-25 18:06:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2022-11-25 18:06:57,854 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 80 [2022-11-25 18:06:57,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:57,855 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2022-11-25 18:06:57,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-25 18:06:57,873 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2022-11-25 18:06:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-25 18:06:57,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:57,875 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:57,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:06:57,875 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:06:57,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:57,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1920697878, now seen corresponding path program 1 times [2022-11-25 18:06:57,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:57,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144127586] [2022-11-25 18:06:57,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:57,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:06:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:06:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:06:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:06:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:06:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:06:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:06:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:06:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:06:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:06:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:06:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:06:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:06:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-25 18:06:59,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:59,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144127586] [2022-11-25 18:06:59,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144127586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:59,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:59,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-25 18:06:59,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097082757] [2022-11-25 18:06:59,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:59,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:06:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:59,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:06:59,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:06:59,683 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-25 18:07:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:01,846 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2022-11-25 18:07:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:07:01,848 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 82 [2022-11-25 18:07:01,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:01,850 INFO L225 Difference]: With dead ends: 178 [2022-11-25 18:07:01,850 INFO L226 Difference]: Without dead ends: 161 [2022-11-25 18:07:01,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:07:01,852 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 193 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:01,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 691 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-25 18:07:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-25 18:07:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 126. [2022-11-25 18:07:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 78 states have internal predecessors, (86), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-25 18:07:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2022-11-25 18:07:01,891 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 82 [2022-11-25 18:07:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:01,892 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2022-11-25 18:07:01,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-25 18:07:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2022-11-25 18:07:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-25 18:07:01,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:01,895 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:01,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:07:01,895 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:07:01,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash -870191708, now seen corresponding path program 1 times [2022-11-25 18:07:01,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:07:01,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707399392] [2022-11-25 18:07:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:07:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:02,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:07:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:02,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:07:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:02,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:07:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:02,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:02,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:07:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:02,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:07:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:02,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:07:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:02,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:07:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:02,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:07:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:07:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:02,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:02,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:07:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:03,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:03,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:03,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:07:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:03,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:07:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:03,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:07:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:03,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:03,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 18:07:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:03,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-25 18:07:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:03,203 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-25 18:07:03,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:07:03,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707399392] [2022-11-25 18:07:03,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707399392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:03,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:03,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:07:03,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500099574] [2022-11-25 18:07:03,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:03,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:07:03,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:07:03,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:07:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:07:03,210 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-25 18:07:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:04,936 INFO L93 Difference]: Finished difference Result 206 states and 249 transitions. [2022-11-25 18:07:04,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:07:04,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2022-11-25 18:07:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:04,939 INFO L225 Difference]: With dead ends: 206 [2022-11-25 18:07:04,939 INFO L226 Difference]: Without dead ends: 151 [2022-11-25 18:07:04,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:07:04,940 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 171 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:04,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 412 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 18:07:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-25 18:07:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-11-25 18:07:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 82 states have internal predecessors, (90), 33 states have call successors, (33), 15 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2022-11-25 18:07:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2022-11-25 18:07:04,975 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 123 [2022-11-25 18:07:04,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:04,977 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2022-11-25 18:07:04,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-25 18:07:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2022-11-25 18:07:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-25 18:07:04,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:04,983 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:04,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:07:04,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:07:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:04,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1724885987, now seen corresponding path program 1 times [2022-11-25 18:07:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:07:04,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805002922] [2022-11-25 18:07:04,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:07:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:07:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:07:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:07:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:07:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:07:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:07:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:07:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:07:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:07:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:07:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:07:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:07:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:07:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:07:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 18:07:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 18:07:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-25 18:07:06,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:07:06,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805002922] [2022-11-25 18:07:06,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805002922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:06,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:06,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:07:06,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251765678] [2022-11-25 18:07:06,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:06,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:07:06,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:07:06,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:07:06,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:07:06,467 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-25 18:07:08,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:08,288 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2022-11-25 18:07:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:07:08,289 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 129 [2022-11-25 18:07:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:08,290 INFO L225 Difference]: With dead ends: 212 [2022-11-25 18:07:08,291 INFO L226 Difference]: Without dead ends: 143 [2022-11-25 18:07:08,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-11-25 18:07:08,292 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 291 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:08,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 409 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 18:07:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-25 18:07:08,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2022-11-25 18:07:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-25 18:07:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-11-25 18:07:08,308 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 129 [2022-11-25 18:07:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:08,309 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-11-25 18:07:08,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-25 18:07:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-11-25 18:07:08,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-25 18:07:08,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:08,315 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:08,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:07:08,315 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:07:08,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:08,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1745997560, now seen corresponding path program 1 times [2022-11-25 18:07:08,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:07:08,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090044510] [2022-11-25 18:07:08,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:08,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:07:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:11,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:07:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:11,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:07:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:11,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:07:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:11,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:11,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:07:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:11,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:07:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:11,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:07:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:11,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:07:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:11,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:07:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:11,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:07:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:11,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:11,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:07:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:12,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:12,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:12,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:07:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:07:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:12,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:07:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:12,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:12,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:07:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:12,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:12,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 18:07:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:13,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 18:07:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-25 18:07:13,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:07:13,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090044510] [2022-11-25 18:07:13,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090044510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:13,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:13,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-25 18:07:13,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294359911] [2022-11-25 18:07:13,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:13,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 18:07:13,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:07:13,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 18:07:13,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:07:13,057 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-11-25 18:07:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:17,004 INFO L93 Difference]: Finished difference Result 190 states and 229 transitions. [2022-11-25 18:07:17,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:07:17,005 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Word has length 134 [2022-11-25 18:07:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:17,007 INFO L225 Difference]: With dead ends: 190 [2022-11-25 18:07:17,008 INFO L226 Difference]: Without dead ends: 143 [2022-11-25 18:07:17,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 18:07:17,010 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 94 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:17,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1034 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-25 18:07:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-25 18:07:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-11-25 18:07:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 88 states have internal predecessors, (93), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2022-11-25 18:07:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 162 transitions. [2022-11-25 18:07:17,030 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 162 transitions. Word has length 134 [2022-11-25 18:07:17,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:17,031 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 162 transitions. [2022-11-25 18:07:17,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-11-25 18:07:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 162 transitions. [2022-11-25 18:07:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-25 18:07:17,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:17,034 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:17,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:07:17,034 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:07:17,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:17,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1524709556, now seen corresponding path program 1 times [2022-11-25 18:07:17,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:07:17,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528230919] [2022-11-25 18:07:17,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:17,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:07:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:07:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:07:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:07:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:07:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:07:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:07:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:07:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:07:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:07:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:07:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 18:07:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:07:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:07:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:07:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:07:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-25 18:07:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 18:07:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-25 18:07:17,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:07:17,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528230919] [2022-11-25 18:07:17,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528230919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:17,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:17,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:07:17,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850650059] [2022-11-25 18:07:17,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:17,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:07:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:07:17,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:07:17,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:07:17,907 INFO L87 Difference]: Start difference. First operand 137 states and 162 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 18:07:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:19,515 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2022-11-25 18:07:19,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:07:19,516 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2022-11-25 18:07:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:19,518 INFO L225 Difference]: With dead ends: 225 [2022-11-25 18:07:19,518 INFO L226 Difference]: Without dead ends: 119 [2022-11-25 18:07:19,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:07:19,519 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 103 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:19,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 425 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-25 18:07:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-25 18:07:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-11-25 18:07:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.082191780821918) internal successors, (79), 74 states have internal predecessors, (79), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-25 18:07:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2022-11-25 18:07:19,534 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 140 [2022-11-25 18:07:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:19,535 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2022-11-25 18:07:19,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 18:07:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-11-25 18:07:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-25 18:07:19,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:19,537 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:19,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:07:19,538 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:07:19,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:19,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1517224244, now seen corresponding path program 1 times [2022-11-25 18:07:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:07:19,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442482707] [2022-11-25 18:07:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:19,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:07:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:07:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:07:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:07:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:07:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:07:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:07:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:07:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:07:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:07:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:07:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:07:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:07:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:07:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:07:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 18:07:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 18:07:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-25 18:07:20,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:07:20,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442482707] [2022-11-25 18:07:20,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442482707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:20,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:20,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:07:20,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898154754] [2022-11-25 18:07:20,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:20,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:07:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:07:20,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:07:20,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:07:20,570 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-25 18:07:21,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:21,766 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-11-25 18:07:21,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:07:21,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2022-11-25 18:07:21,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:21,769 INFO L225 Difference]: With dead ends: 166 [2022-11-25 18:07:21,769 INFO L226 Difference]: Without dead ends: 120 [2022-11-25 18:07:21,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:07:21,770 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 123 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:21,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 249 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 18:07:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-25 18:07:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-25 18:07:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 75 states have internal predecessors, (80), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-25 18:07:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2022-11-25 18:07:21,788 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 135 [2022-11-25 18:07:21,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:21,792 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2022-11-25 18:07:21,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-25 18:07:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2022-11-25 18:07:21,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-25 18:07:21,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:21,795 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:21,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:07:21,796 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:07:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:21,796 INFO L85 PathProgramCache]: Analyzing trace with hash -473758278, now seen corresponding path program 1 times [2022-11-25 18:07:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:07:21,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984889590] [2022-11-25 18:07:21,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:21,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:07:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:07:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:07:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:07:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:07:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:07:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:07:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:07:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:07:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:07:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:07:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:07:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:07:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:25,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:07:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:26,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:26,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:07:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:26,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:26,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 18:07:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 18:07:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-25 18:07:26,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:07:26,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984889590] [2022-11-25 18:07:26,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984889590] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:07:26,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987176999] [2022-11-25 18:07:26,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:26,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:07:26,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:07:26,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:07:26,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:07:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:27,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 2927 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-25 18:07:27,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:28,993 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 18:07:31,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:31,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:31,913 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 18:07:31,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 33 [2022-11-25 18:07:32,077 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:07:32,077 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-25 18:07:33,566 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-25 18:07:33,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-25 18:07:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-25 18:07:33,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:07:39,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987176999] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:07:39,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:07:39,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 57 [2022-11-25 18:07:39,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281802502] [2022-11-25 18:07:39,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:07:39,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-25 18:07:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:07:39,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-25 18:07:39,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=4118, Unknown=3, NotChecked=0, Total=4290 [2022-11-25 18:07:39,552 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-25 18:07:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:55,959 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-11-25 18:07:55,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-25 18:07:55,960 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) Word has length 136 [2022-11-25 18:07:55,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:55,962 INFO L225 Difference]: With dead ends: 174 [2022-11-25 18:07:55,962 INFO L226 Difference]: Without dead ends: 123 [2022-11-25 18:07:55,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1859 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=514, Invalid=9781, Unknown=7, NotChecked=0, Total=10302 [2022-11-25 18:07:55,966 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 280 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 4753 mSolverCounterSat, 211 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 4969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 4753 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:55,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1341 Invalid, 4969 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [211 Valid, 4753 Invalid, 5 Unknown, 0 Unchecked, 12.4s Time] [2022-11-25 18:07:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-25 18:07:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-11-25 18:07:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-25 18:07:55,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2022-11-25 18:07:55,985 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 136 [2022-11-25 18:07:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:55,987 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2022-11-25 18:07:55,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-25 18:07:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2022-11-25 18:07:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-25 18:07:55,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:55,990 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:56,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 18:07:56,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 18:07:56,201 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:07:56,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1103785842, now seen corresponding path program 2 times [2022-11-25 18:07:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:07:56,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125141187] [2022-11-25 18:07:56,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:56,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:07:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:59,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:07:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:59,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:07:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:07:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:59,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:59,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:07:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:59,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:07:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:59,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:07:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:59,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:07:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:59,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:07:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:59,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:07:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:59,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:07:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:00,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:08:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:08:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:00,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:08:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:00,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:08:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:08:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:00,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:08:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:00,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:08:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:00,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:08:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:00,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:08:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:00,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 18:08:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:01,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-25 18:08:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:01,228 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-25 18:08:01,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:01,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125141187] [2022-11-25 18:08:01,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125141187] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:08:01,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792897947] [2022-11-25 18:08:01,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:08:01,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:08:01,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:08:01,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:08:01,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:08:02,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:08:02,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:08:02,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 3055 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-25 18:08:02,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:08:03,054 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 18:08:03,393 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_11| Int) (v_ArrVal_1272 Int) (v_ArrVal_1263 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_1263) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_11| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1272))) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_11|)))) is different from true [2022-11-25 18:08:03,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:03,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:03,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-25 18:08:04,141 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:08:04,141 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-25 18:08:05,728 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-25 18:08:05,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-25 18:08:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 2 not checked. [2022-11-25 18:08:05,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:08:11,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792897947] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:08:11,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:08:11,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 50 [2022-11-25 18:08:11,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713338250] [2022-11-25 18:08:11,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:08:11,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 18:08:11,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 18:08:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=3165, Unknown=1, NotChecked=112, Total=3422 [2022-11-25 18:08:11,813 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-25 18:08:24,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:08:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:08:34,130 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2022-11-25 18:08:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:08:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 137 [2022-11-25 18:08:34,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:08:34,133 INFO L225 Difference]: With dead ends: 173 [2022-11-25 18:08:34,133 INFO L226 Difference]: Without dead ends: 122 [2022-11-25 18:08:34,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=338, Invalid=6636, Unknown=2, NotChecked=164, Total=7140 [2022-11-25 18:08:34,136 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 167 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 3869 mSolverCounterSat, 122 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 4142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 3869 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:08:34,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1557 Invalid, 4142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 3869 Invalid, 9 Unknown, 142 Unchecked, 16.0s Time] [2022-11-25 18:08:34,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-25 18:08:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-25 18:08:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 77 states have internal predecessors, (82), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-25 18:08:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2022-11-25 18:08:34,154 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 137 [2022-11-25 18:08:34,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:08:34,155 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2022-11-25 18:08:34,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-25 18:08:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2022-11-25 18:08:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-25 18:08:34,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:08:34,158 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1] [2022-11-25 18:08:34,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:08:34,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 18:08:34,375 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:08:34,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash 840196154, now seen corresponding path program 3 times [2022-11-25 18:08:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:08:34,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000524336] [2022-11-25 18:08:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:08:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:37,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:08:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:37,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:08:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:08:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:37,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:08:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:37,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:08:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:37,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:08:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:37,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:08:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:08:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:37,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:08:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:37,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:08:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:38,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:08:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:38,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:08:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:38,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:08:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:38,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:08:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:38,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:08:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:08:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:38,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:08:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:38,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:08:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:38,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:08:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:38,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:08:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:38,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 18:08:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 18:08:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-25 18:08:39,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:39,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000524336] [2022-11-25 18:08:39,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000524336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:08:39,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973119038] [2022-11-25 18:08:39,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:08:39,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:08:39,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:08:39,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:08:39,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:08:42,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 18:08:42,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:08:42,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 2855 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-25 18:08:42,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:08:43,053 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 18:08:43,258 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1926 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_19| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_19| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1926)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_19|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_19| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) is different from true [2022-11-25 18:08:43,286 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_20| Int) (v_ArrVal_1926 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_19| Int) (v_ArrVal_1930 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_19| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_20|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_19| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1926) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_20| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1930))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_20| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_19|))) is different from true [2022-11-25 18:08:43,322 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_20| Int) (v_ArrVal_1926 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_21| Int) (v_ArrVal_1939 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_19| Int) (v_ArrVal_1930 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_20| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_21|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_19| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_20|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_19|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_19| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1926) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_20| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1930) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_21| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1939)) |c_#memory_int|))) is different from true [2022-11-25 18:08:44,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:44,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:44,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:44,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:44,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:44,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:44,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:44,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:44,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:44,153 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 18:08:44,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2022-11-25 18:08:44,319 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:08:44,319 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-11-25 18:08:45,737 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-25 18:08:45,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 61 [2022-11-25 18:08:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 150 trivial. 6 not checked. [2022-11-25 18:08:46,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:08:55,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973119038] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:08:55,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:08:55,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 52 [2022-11-25 18:08:55,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475004969] [2022-11-25 18:08:55,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:08:55,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 18:08:55,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:55,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 18:08:55,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=3167, Unknown=4, NotChecked=342, Total=3660 [2022-11-25 18:08:55,065 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-25 18:09:13,337 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 18:09:21,425 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 18:09:36,403 WARN L233 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 63 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:09:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:38,337 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-11-25 18:09:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 18:09:38,339 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 138 [2022-11-25 18:09:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:38,340 INFO L225 Difference]: With dead ends: 174 [2022-11-25 18:09:38,340 INFO L226 Difference]: Without dead ends: 123 [2022-11-25 18:09:38,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=352, Invalid=6962, Unknown=8, NotChecked=510, Total=7832 [2022-11-25 18:09:38,344 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 147 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 4066 mSolverCounterSat, 90 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 4605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 4066 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 436 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:38,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1603 Invalid, 4605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 4066 Invalid, 13 Unknown, 436 Unchecked, 23.6s Time] [2022-11-25 18:09:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-25 18:09:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-11-25 18:09:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 77 states have (on average 1.077922077922078) internal successors, (83), 78 states have internal predecessors, (83), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-25 18:09:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2022-11-25 18:09:38,363 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 138 [2022-11-25 18:09:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:38,363 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2022-11-25 18:09:38,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-25 18:09:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2022-11-25 18:09:38,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-25 18:09:38,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:38,366 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:38,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:09:38,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:09:38,583 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:38,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:38,583 INFO L85 PathProgramCache]: Analyzing trace with hash 974095886, now seen corresponding path program 4 times [2022-11-25 18:09:38,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:38,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404897460] [2022-11-25 18:09:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:38,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:41,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:41,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:09:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:09:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:09:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:09:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:09:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:09:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:09:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:09:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:09:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:09:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:09:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:09:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:09:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:09:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:09:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:09:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:09:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:09:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:43,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:09:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:43,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 18:09:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:43,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-25 18:09:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-25 18:09:43,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:43,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404897460] [2022-11-25 18:09:43,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404897460] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:09:43,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359204661] [2022-11-25 18:09:43,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:09:43,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:09:43,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:09:43,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:09:43,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:09:44,978 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:09:44,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:09:44,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 3311 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-25 18:09:45,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:09:46,273 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 18:09:48,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:48,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:48,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:48,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:48,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:09:48,828 INFO L321 Elim1Store]: treesize reduction 54, result has 48.6 percent of original size [2022-11-25 18:09:48,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 72 [2022-11-25 18:09:48,999 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:09:49,000 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-25 18:09:50,621 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-25 18:09:50,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-25 18:09:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-25 18:09:50,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:09:59,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359204661] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:09:59,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:09:59,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 40] total 63 [2022-11-25 18:09:59,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286186604] [2022-11-25 18:09:59,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:09:59,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-25 18:09:59,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:59,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-25 18:09:59,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=4928, Unknown=0, NotChecked=0, Total=5112 [2022-11-25 18:09:59,687 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 63 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 48 states have internal predecessors, (130), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-25 18:10:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:33,849 INFO L93 Difference]: Finished difference Result 177 states and 209 transitions. [2022-11-25 18:10:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-25 18:10:33,850 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 48 states have internal predecessors, (130), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) Word has length 139 [2022-11-25 18:10:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:33,851 INFO L225 Difference]: With dead ends: 177 [2022-11-25 18:10:33,852 INFO L226 Difference]: Without dead ends: 126 [2022-11-25 18:10:33,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2273 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=552, Invalid=11655, Unknown=3, NotChecked=0, Total=12210 [2022-11-25 18:10:33,856 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 277 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 5162 mSolverCounterSat, 207 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 5375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 5162 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:33,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1446 Invalid, 5375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 5162 Invalid, 6 Unknown, 0 Unchecked, 27.5s Time] [2022-11-25 18:10:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-25 18:10:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-11-25 18:10:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 79 states have internal predecessors, (84), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-25 18:10:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2022-11-25 18:10:33,876 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 139 [2022-11-25 18:10:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:33,877 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2022-11-25 18:10:33,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 48 states have internal predecessors, (130), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-25 18:10:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2022-11-25 18:10:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-25 18:10:33,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:33,880 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:33,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:10:34,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:34,097 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:34,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:34,097 INFO L85 PathProgramCache]: Analyzing trace with hash 830020282, now seen corresponding path program 5 times [2022-11-25 18:10:34,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:34,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638558601] [2022-11-25 18:10:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:34,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:37,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:37,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:37,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:37,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:37,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:10:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:37,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:10:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:37,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:10:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:37,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:10:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:37,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:10:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:37,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:10:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:37,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:37,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:10:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:38,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:38,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:38,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:10:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:38,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:10:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:38,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:10:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:38,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:10:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:38,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 18:10:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:39,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 18:10:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-25 18:10:39,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:39,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638558601] [2022-11-25 18:10:39,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638558601] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:39,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355941600] [2022-11-25 18:10:39,608 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:10:39,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:39,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:39,621 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:39,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:11:09,173 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-11-25 18:11:09,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:11:09,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 3439 conjuncts, 170 conjunts are in the unsatisfiable core [2022-11-25 18:11:09,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:10,973 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 18:11:11,459 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3800 Int) (v_ArrVal_3794 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_46| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_3794) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_46| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3800))) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_46|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_46| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) is different from true [2022-11-25 18:11:11,493 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3800 Int) (v_ArrVal_3809 Int) (v_ArrVal_3794 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_46| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_47| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_3794) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_46| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3800) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_47| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3809)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_46|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_47| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_46| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_47|))) is different from true [2022-11-25 18:11:11,600 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3812 Int) (v_ArrVal_3800 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67| Int) (v_ArrVal_3809 Int) (v_ArrVal_3794 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_46| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_47| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_47| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67| .cse0 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_46|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_3794) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_46| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3800) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_47| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3809) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3812))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_46| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_47|)))) is different from true [2022-11-25 18:11:11,699 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3812 Int) (v_ArrVal_3800 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67| Int) (v_ArrVal_3820 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_49| Int) (v_ArrVal_3809 Int) (v_ArrVal_3794 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_46| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_47| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67|))) (and (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_49|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_47| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67| .cse0)) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_3794) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_46| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3800) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_47| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3809) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_48_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3812) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_49| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3820)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_46|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_46| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_47|)))) is different from true [2022-11-25 18:11:13,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:13,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2022-11-25 18:11:13,548 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:11:13,548 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-25 18:11:15,310 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-25 18:11:15,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-25 18:11:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 126 trivial. 14 not checked. [2022-11-25 18:11:15,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:11:31,171 WARN L233 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 108 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:11:31,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355941600] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:31,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:11:31,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 44] total 70 [2022-11-25 18:11:31,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648172997] [2022-11-25 18:11:31,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:11:31,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-25 18:11:31,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:31,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-25 18:11:31,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=5363, Unknown=11, NotChecked=596, Total=6162 [2022-11-25 18:11:31,181 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand has 70 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 53 states have internal predecessors, (123), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-11-25 18:12:32,316 WARN L233 SmtUtils]: Spent 8.62s on a formula simplification. DAG size of input: 85 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:12:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:35,931 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2022-11-25 18:12:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-25 18:12:35,932 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 53 states have internal predecessors, (123), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) Word has length 140 [2022-11-25 18:12:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:35,933 INFO L225 Difference]: With dead ends: 178 [2022-11-25 18:12:35,933 INFO L226 Difference]: Without dead ends: 130 [2022-11-25 18:12:35,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2532 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=588, Invalid=13914, Unknown=34, NotChecked=964, Total=15500 [2022-11-25 18:12:35,937 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 180 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 6049 mSolverCounterSat, 116 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 6784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 6049 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 600 IncrementalHoareTripleChecker+Unchecked, 41.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:12:35,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1784 Invalid, 6784 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [116 Valid, 6049 Invalid, 19 Unknown, 600 Unchecked, 41.5s Time] [2022-11-25 18:12:35,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-25 18:12:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2022-11-25 18:12:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 79 states have (on average 1.0759493670886076) internal successors, (85), 80 states have internal predecessors, (85), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-25 18:12:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2022-11-25 18:12:35,960 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 140 [2022-11-25 18:12:35,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:35,961 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2022-11-25 18:12:35,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 53 states have internal predecessors, (123), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-11-25 18:12:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2022-11-25 18:12:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-25 18:12:35,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:35,963 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:12:36,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:12:36,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 18:12:36,178 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:12:36,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:36,179 INFO L85 PathProgramCache]: Analyzing trace with hash -723622004, now seen corresponding path program 6 times [2022-11-25 18:12:36,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:36,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800426565] [2022-11-25 18:12:36,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:36,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:12:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:12:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:12:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:12:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:12:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:12:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:12:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:12:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:12:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:12:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:12:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:12:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:12:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:12:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:12:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:12:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:12:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:12:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:12:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:37,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 18:12:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:38,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-25 18:12:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-25 18:12:38,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:38,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800426565] [2022-11-25 18:12:38,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800426565] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:12:38,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096599328] [2022-11-25 18:12:38,175 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 18:12:38,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:12:38,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:12:38,176 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:12:38,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:13:24,501 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-25 18:13:24,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:13:24,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 3436 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-25 18:13:24,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:24,818 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 18:13:24,960 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_66| Int) (v_ArrVal_4858 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_66| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_66|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_66| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4858)) |c_#memory_int|))) is different from true [2022-11-25 18:13:24,983 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_66| Int) (v_ArrVal_4858 Int) (v_ArrVal_4863 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_67| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_66| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4858) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4863)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_67| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_66|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_66| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_67|))) is different from true [2022-11-25 18:13:25,015 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_66| Int) (v_ArrVal_4858 Int) (v_ArrVal_4869 Int) (v_ArrVal_4863 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_67| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_68| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_68|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_66|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_66| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_67|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_66| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4858) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4863) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4869)) |c_#memory_int|))) is different from true [2022-11-25 18:13:25,056 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_66| Int) (v_ArrVal_4879 Int) (v_ArrVal_4858 Int) (v_ArrVal_4869 Int) (v_ArrVal_4863 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_67| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_66| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4858) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4863) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4869) (+ (- 1) |c_#Ultimate.C_memcpy_dest.offset| |c_#Ultimate.C_memcpy_#t~loopctr1316|) v_ArrVal_4879)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_68|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_66|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_66| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_68| 2) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) is different from true [2022-11-25 18:13:25,104 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_66| Int) (v_ArrVal_4879 Int) (v_ArrVal_4858 Int) (v_ArrVal_4869 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_70| Int) (v_ArrVal_4863 Int) (v_ArrVal_4883 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_67| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_68|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_66|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_68| 2) |v_#Ultimate.C_memcpy_#t~loopctr1316_70|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_66| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_67|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_66| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4858) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4863) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4869) (+ (- 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_70| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4879) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_70| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4883)) |c_#memory_int|))) is different from true [2022-11-25 18:13:26,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,492 INFO L321 Elim1Store]: treesize reduction 88, result has 44.3 percent of original size [2022-11-25 18:13:26,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 22 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 98 [2022-11-25 18:13:26,654 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:13:26,654 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-25 18:13:27,947 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-25 18:13:27,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-25 18:13:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 150 trivial. 15 not checked. [2022-11-25 18:13:28,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:13:37,447 WARN L233 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 180 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 18:13:48,509 WARN L233 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:13:48,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096599328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:13:48,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:13:48,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 32] total 44 [2022-11-25 18:13:48,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512900042] [2022-11-25 18:13:48,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:13:48,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-25 18:13:48,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:13:48,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-25 18:13:48,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2138, Unknown=5, NotChecked=480, Total=2756 [2022-11-25 18:13:48,515 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand has 44 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 32 states have internal predecessors, (102), 5 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (26), 7 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-25 18:14:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:17,135 INFO L93 Difference]: Finished difference Result 175 states and 206 transitions. [2022-11-25 18:14:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:14:17,136 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 32 states have internal predecessors, (102), 5 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (26), 7 states have call predecessors, (26), 4 states have call successors, (26) Word has length 141 [2022-11-25 18:14:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:17,138 INFO L225 Difference]: With dead ends: 175 [2022-11-25 18:14:17,138 INFO L226 Difference]: Without dead ends: 126 [2022-11-25 18:14:17,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=227, Invalid=3690, Unknown=9, NotChecked=630, Total=4556 [2022-11-25 18:14:17,140 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 223 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 180 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 3611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 726 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:17,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1120 Invalid, 3611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2702 Invalid, 3 Unknown, 726 Unchecked, 17.9s Time] [2022-11-25 18:14:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-25 18:14:17,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-25 18:14:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.075) internal successors, (86), 81 states have internal predecessors, (86), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-25 18:14:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2022-11-25 18:14:17,179 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 141 [2022-11-25 18:14:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:17,180 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2022-11-25 18:14:17,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 32 states have internal predecessors, (102), 5 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (26), 7 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-25 18:14:17,181 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2022-11-25 18:14:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-25 18:14:17,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:17,197 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:14:17,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:14:17,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 18:14:17,398 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:14:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:17,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1741323976, now seen corresponding path program 7 times [2022-11-25 18:14:17,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:14:17,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563427345] [2022-11-25 18:14:17,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:17,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:14:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:14:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:14:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:14:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:14:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:14:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:14:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:14:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:14:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:14:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:14:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:14:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:14:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:14:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:14:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:14:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:14:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:14:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:14:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:14:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:14:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 18:14:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-25 18:14:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-25 18:14:19,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:14:19,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563427345] [2022-11-25 18:14:19,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563427345] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:14:19,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920639217] [2022-11-25 18:14:19,411 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 18:14:19,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:14:19,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:14:19,414 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:14:19,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:14:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:21,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 3590 conjuncts, 162 conjunts are in the unsatisfiable core [2022-11-25 18:14:21,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:22,225 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 18:14:22,567 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_6096 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_88| Int) (v_ArrVal_6103 Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_88|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_6096) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6103)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-11-25 18:14:22,599 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6096 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_88| Int) (v_ArrVal_6109 Int) (v_ArrVal_6103 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_89| Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_88|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_6096) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6103) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_89| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6109))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_89| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_89|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-11-25 18:14:22,643 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_6096 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_88| Int) (v_ArrVal_6109 Int) (v_ArrVal_6103 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_90| Int) (v_ArrVal_6113 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_89| Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_88|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_90| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_89| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_90|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_89|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_6096) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6103) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_89| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6109) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_90| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6113)) |c_#memory_int|)))) is different from true [2022-11-25 18:14:22,708 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_6096 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_88| Int) (v_ArrVal_6109 Int) (v_ArrVal_6119 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_91| Int) (v_ArrVal_6103 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_90| Int) (v_ArrVal_6113 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_89| Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_88|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_89| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_90|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_90| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_91|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_91| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_89|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_6096) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6103) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_89| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6109) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_90| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6113) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_91| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6119)))))) is different from true [2022-11-25 18:14:22,785 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6096 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_88| Int) (v_ArrVal_6109 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_92| Int) (v_ArrVal_6119 Int) (v_ArrVal_6128 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_91| Int) (v_ArrVal_6103 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_90| Int) (v_ArrVal_6113 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_89| Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_88|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_6096) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6103) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_89| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6109) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_90| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6113) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_91| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6119) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_92| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6128)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_89| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_90|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_91| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_92|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_90| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_91|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_89|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-11-25 18:14:24,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:14:24,615 INFO L321 Elim1Store]: treesize reduction 70, result has 48.5 percent of original size [2022-11-25 18:14:24,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 94 [2022-11-25 18:14:24,788 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:14:24,789 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-25 18:14:26,195 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-25 18:14:26,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-25 18:14:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 57 trivial. 20 not checked. [2022-11-25 18:14:26,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:14:41,441 WARN L233 SmtUtils]: Spent 12.37s on a formula simplification that was a NOOP. DAG size: 208 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 18:14:59,260 WARN L233 SmtUtils]: Spent 14.15s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:14:59,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920639217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:14:59,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:14:59,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 44] total 57 [2022-11-25 18:14:59,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670758964] [2022-11-25 18:14:59,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:14:59,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-25 18:14:59,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:14:59,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-25 18:14:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3507, Unknown=5, NotChecked=610, Total=4290 [2022-11-25 18:14:59,283 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 57 states, 52 states have (on average 2.3846153846153846) internal successors, (124), 43 states have internal predecessors, (124), 9 states have call successors, (38), 10 states have call predecessors, (38), 11 states have return successors, (33), 11 states have call predecessors, (33), 8 states have call successors, (33) [2022-11-25 18:15:44,930 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 18:15:56,008 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 18:16:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:02,885 INFO L93 Difference]: Finished difference Result 178 states and 209 transitions. [2022-11-25 18:16:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:16:02,886 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 52 states have (on average 2.3846153846153846) internal successors, (124), 43 states have internal predecessors, (124), 9 states have call successors, (38), 10 states have call predecessors, (38), 11 states have return successors, (33), 11 states have call predecessors, (33), 8 states have call successors, (33) Word has length 142 [2022-11-25 18:16:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:02,888 INFO L225 Difference]: With dead ends: 178 [2022-11-25 18:16:02,888 INFO L226 Difference]: Without dead ends: 129 [2022-11-25 18:16:02,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 42.9s TimeCoverageRelationStatistics Valid=419, Invalid=7778, Unknown=13, NotChecked=910, Total=9120 [2022-11-25 18:16:02,891 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 303 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 4120 mSolverCounterSat, 245 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 5108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 4120 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 736 IncrementalHoareTripleChecker+Unchecked, 42.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:02,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1098 Invalid, 5108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 4120 Invalid, 7 Unknown, 736 Unchecked, 42.4s Time] [2022-11-25 18:16:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-25 18:16:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2022-11-25 18:16:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 81 states have (on average 1.0740740740740742) internal successors, (87), 82 states have internal predecessors, (87), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-25 18:16:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2022-11-25 18:16:02,913 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 142 [2022-11-25 18:16:02,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:02,914 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2022-11-25 18:16:02,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 52 states have (on average 2.3846153846153846) internal successors, (124), 43 states have internal predecessors, (124), 9 states have call successors, (38), 10 states have call predecessors, (38), 11 states have return successors, (33), 11 states have call predecessors, (33), 8 states have call successors, (33) [2022-11-25 18:16:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2022-11-25 18:16:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-25 18:16:02,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:02,916 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:02,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:03,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 18:16:03,117 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:16:03,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1069653260, now seen corresponding path program 8 times [2022-11-25 18:16:03,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:03,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9504244] [2022-11-25 18:16:03,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:03,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:16:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:16:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:16:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:16:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:16:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:16:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:16:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:16:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:16:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:16:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:16:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:16:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:16:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:16:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:16:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:16:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:16:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:16:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:16:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:16:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:04,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 18:16:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:05,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-25 18:16:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-25 18:16:05,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:05,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9504244] [2022-11-25 18:16:05,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9504244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:05,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465668174] [2022-11-25 18:16:05,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:16:05,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:05,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:05,454 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:05,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:16:08,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:16:08,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:16:08,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 3718 conjuncts, 121 conjunts are in the unsatisfiable core [2022-11-25 18:16:08,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:09,204 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 18:16:09,372 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7517 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7517)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_112|))) is different from true [2022-11-25 18:16:09,400 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7517 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (v_ArrVal_7521 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7517) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7521)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_112|))) is different from true [2022-11-25 18:16:09,434 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7517 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (v_ArrVal_7521 Int) (v_ArrVal_7532 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_114| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_114|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7517) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7521) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7532)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_112|))) is different from true [2022-11-25 18:16:09,482 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7517 Int) (v_ArrVal_7536 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (v_ArrVal_7521 Int) (v_ArrVal_7532 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_114| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_115| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_115|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7517) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7521) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7532) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7536)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_114|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_112|))) is different from true [2022-11-25 18:16:09,549 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7517 Int) (v_ArrVal_7536 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (v_ArrVal_7521 Int) (v_ArrVal_7532 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_114| Int) (v_ArrVal_7542 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_115| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_116| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_115|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_114|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_116| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_116|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7517) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7521) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7532) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7536) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_116| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7542))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_112|))) is different from true [2022-11-25 18:16:09,636 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_117| Int) (v_ArrVal_7517 Int) (v_ArrVal_7549 Int) (v_ArrVal_7536 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (v_ArrVal_7521 Int) (v_ArrVal_7532 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_114| Int) (v_ArrVal_7542 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_115| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_116| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_115|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_114|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_116|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_116| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_117|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7517) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7521) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7532) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7536) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_116| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7542) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_117| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7549)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_117| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_112|))) is different from true [2022-11-25 18:16:09,750 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_117| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_118| Int) (v_ArrVal_7517 Int) (v_ArrVal_7549 Int) (v_ArrVal_7536 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (v_ArrVal_7521 Int) (v_ArrVal_7532 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_114| Int) (v_ArrVal_7542 Int) (v_ArrVal_7553 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_115| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_116| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7517) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7521) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7532) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7536) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_116| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7542) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_117| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7549) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_118| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7553)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_115|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_114|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_117| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_118|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_116|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_116| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_117|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_112|))) is different from true [2022-11-25 18:16:12,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:12,291 INFO L321 Elim1Store]: treesize reduction 115, result has 45.2 percent of original size [2022-11-25 18:16:12,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 37 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 123 [2022-11-25 18:16:12,514 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:16:12,515 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-11-25 18:16:13,982 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-25 18:16:13,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 61 [2022-11-25 18:16:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 150 trivial. 28 not checked. [2022-11-25 18:16:14,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:46,363 WARN L233 SmtUtils]: Spent 29.46s on a formula simplification that was a NOOP. DAG size: 234 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 18:17:01,183 WARN L233 SmtUtils]: Spent 9.21s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:17:01,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465668174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:01,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:17:01,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 34] total 48 [2022-11-25 18:17:01,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941675146] [2022-11-25 18:17:01,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:01,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-25 18:17:01,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:01,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-25 18:17:01,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2334, Unknown=8, NotChecked=714, Total=3192 [2022-11-25 18:17:01,191 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 48 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 36 states have internal predecessors, (106), 5 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (26), 7 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-25 18:17:37,658 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 18:17:48,386 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 18:17:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:54,908 INFO L93 Difference]: Finished difference Result 177 states and 208 transitions. [2022-11-25 18:17:54,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:17:54,909 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 36 states have internal predecessors, (106), 5 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (26), 7 states have call predecessors, (26), 4 states have call successors, (26) Word has length 143 [2022-11-25 18:17:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:54,911 INFO L225 Difference]: With dead ends: 177 [2022-11-25 18:17:54,911 INFO L226 Difference]: Without dead ends: 128 [2022-11-25 18:17:54,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=234, Invalid=4205, Unknown=11, NotChecked=952, Total=5402 [2022-11-25 18:17:54,913 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 161 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 3337 mSolverCounterSat, 110 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 4469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 3337 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 1015 IncrementalHoareTripleChecker+Unchecked, 44.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:54,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1381 Invalid, 4469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 3337 Invalid, 7 Unknown, 1015 Unchecked, 44.0s Time] [2022-11-25 18:17:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-25 18:17:54,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-11-25 18:17:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 83 states have internal predecessors, (88), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-25 18:17:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2022-11-25 18:17:54,944 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 143 [2022-11-25 18:17:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:54,944 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2022-11-25 18:17:54,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 36 states have internal predecessors, (106), 5 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (26), 7 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-25 18:17:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2022-11-25 18:17:54,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-25 18:17:54,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:54,947 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:54,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-25 18:17:55,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 18:17:55,154 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:17:55,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:55,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1984365640, now seen corresponding path program 9 times [2022-11-25 18:17:55,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:55,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475043404] [2022-11-25 18:17:55,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:55,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:17:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:17:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:17:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:17:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:17:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:17:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:17:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:17:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:17:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:17:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:17:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:17:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:17:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:17:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:17:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:17:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:17:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:17:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:17:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:57,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 18:17:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:57,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 18:17:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-25 18:17:57,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:57,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475043404] [2022-11-25 18:17:57,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475043404] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:57,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471180991] [2022-11-25 18:17:57,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:17:57,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:57,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:57,910 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:17:57,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df5d33c8-6958-4f46-a298-9ede48d275da/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process