./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/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_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/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_22dae6b9-0463-4f42-a4f3-dae2d08dc992/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 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e --- 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:22:42,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:22:42,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:22:42,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:22:42,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:22:42,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:22:42,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:22:42,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:22:42,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:22:42,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:22:42,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:22:42,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:22:42,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:22:42,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:22:42,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:22:42,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:22:42,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:22:42,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:22:42,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:22:42,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:22:42,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:22:42,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:22:42,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:22:42,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:22:42,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:22:42,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:22:42,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:22:42,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:22:42,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:22:42,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:22:42,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:22:42,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:22:42,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:22:42,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:22:42,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:22:42,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:22:42,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:22:42,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:22:42,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:22:42,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:22:42,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:22:42,275 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 18:22:42,304 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:22:42,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:22:42,305 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:22:42,305 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:22:42,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:22:42,306 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:22:42,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:22:42,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:22:42,308 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:22:42,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:22:42,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:22:42,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:22:42,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:22:42,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:22:42,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:22:42,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:22:42,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:22:42,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:22:42,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:22:42,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:22:42,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:22:42,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:22:42,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:22:42,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:22:42,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:22:42,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:22:42,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:22:42,314 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:22:42,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:22:42,315 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:22:42,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:22:42,316 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_22dae6b9-0463-4f42-a4f3-dae2d08dc992/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_22dae6b9-0463-4f42-a4f3-dae2d08dc992/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 -> 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e [2022-11-25 18:22:42,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:22:42,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:22:42,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:22:42,738 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:22:42,738 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:22:42,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2022-11-25 18:22:46,215 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:22:46,808 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:22:46,810 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2022-11-25 18:22:46,851 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/data/111a241a9/dfe94d0045274d83ba156dec8d18ec8b/FLAGcaab57db3 [2022-11-25 18:22:46,868 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/data/111a241a9/dfe94d0045274d83ba156dec8d18ec8b [2022-11-25 18:22:46,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:22:46,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:22:46,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:22:46,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:22:46,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:22:46,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0a0bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46, skipping insertion in model container [2022-11-25 18:22:46,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:22:47,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:22:47,345 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_22dae6b9-0463-4f42-a4f3-dae2d08dc992/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4494,4507] [2022-11-25 18:22:47,360 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_22dae6b9-0463-4f42-a4f3-dae2d08dc992/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4554,4567] [2022-11-25 18:22:48,398 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:48,398 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:48,400 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:48,401 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:48,402 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:48,416 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:48,417 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:48,419 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:48,420 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:48,422 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:48,423 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:48,425 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:48,425 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:48,498 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:22:48,499 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:22:48,500 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:22:48,505 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:22:48,508 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:22:48,509 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:22:48,784 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:22:48,786 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:22:48,787 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:22:48,788 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:22:48,790 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:22:48,792 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:22:48,793 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:22:48,793 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:22:48,794 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:22:48,795 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:22:48,796 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:22:49,027 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 18:22:49,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:22:49,090 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:22:49,119 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_22dae6b9-0463-4f42-a4f3-dae2d08dc992/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4494,4507] [2022-11-25 18:22:49,120 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_22dae6b9-0463-4f42-a4f3-dae2d08dc992/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4554,4567] [2022-11-25 18:22:49,171 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:49,172 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:49,173 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:49,173 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:49,174 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:49,183 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:49,184 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:49,185 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:49,185 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:49,187 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:49,188 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:49,188 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:49,189 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:22:49,197 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:22:49,198 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:22:49,199 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:22:49,203 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:22:49,205 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:22:49,205 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:22:49,234 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:22:49,235 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:22:49,237 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:22:49,238 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:22:49,239 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:22:49,240 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:22:49,241 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:22:49,242 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:22:49,243 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:22:49,244 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:22:49,244 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:22:49,275 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 18:22:49,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:22:49,581 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:22:49,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:49 WrapperNode [2022-11-25 18:22:49,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:22:49,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:22:49,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:22:49,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:22:49,591 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:22:49" (1/1) ... [2022-11-25 18:22:49,661 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:22:49" (1/1) ... [2022-11-25 18:22:49,716 INFO L138 Inliner]: procedures = 679, calls = 1038, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 57 [2022-11-25 18:22:49,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:22:49,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:22:49,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:22:49,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:22:49,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:49" (1/1) ... [2022-11-25 18:22:49,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:49" (1/1) ... [2022-11-25 18:22:49,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:49" (1/1) ... [2022-11-25 18:22:49,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:49" (1/1) ... [2022-11-25 18:22:49,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:49" (1/1) ... [2022-11-25 18:22:49,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:49" (1/1) ... [2022-11-25 18:22:49,783 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:49" (1/1) ... [2022-11-25 18:22:49,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:49" (1/1) ... [2022-11-25 18:22:49,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:22:49,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:22:49,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:22:49,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:22:49,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:49" (1/1) ... [2022-11-25 18:22:49,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:22:49,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:22:49,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:22:49,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:22:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:22:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 18:22:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 18:22:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-25 18:22:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-25 18:22:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:22:49,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:22:49,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:22:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:22:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 18:22:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 18:22:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:22:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:22:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:22:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-25 18:22:49,904 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-25 18:22:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:22:50,221 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:22:50,224 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:22:50,439 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:22:50,446 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:22:50,446 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:22:50,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:22:50 BoogieIcfgContainer [2022-11-25 18:22:50,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:22:50,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:22:50,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:22:50,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:22:50,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:22:46" (1/3) ... [2022-11-25 18:22:50,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a30f5d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:22:50, skipping insertion in model container [2022-11-25 18:22:50,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:49" (2/3) ... [2022-11-25 18:22:50,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a30f5d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:22:50, skipping insertion in model container [2022-11-25 18:22:50,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:22:50" (3/3) ... [2022-11-25 18:22:50,457 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_next_harness.i [2022-11-25 18:22:50,499 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:22:50,499 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:22:50,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:22:50,552 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;@b226bb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:22:50,552 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:22:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 18:22:50,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:22:50,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:50,564 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:50,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:50,571 INFO L85 PathProgramCache]: Analyzing trace with hash 829036907, now seen corresponding path program 1 times [2022-11-25 18:22:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:50,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193638222] [2022-11-25 18:22:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:50,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:50,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:51,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:22:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:51,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:22:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 18:22:51,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:51,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193638222] [2022-11-25 18:22:51,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193638222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:51,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:51,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:22:51,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362262968] [2022-11-25 18:22:51,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:51,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:22:51,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:51,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:22:51,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:22:51,284 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:22:51,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:51,320 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2022-11-25 18:22:51,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:22:51,323 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-11-25 18:22:51,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:51,333 INFO L225 Difference]: With dead ends: 94 [2022-11-25 18:22:51,334 INFO L226 Difference]: Without dead ends: 45 [2022-11-25 18:22:51,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:22:51,342 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:51,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-25 18:22:51,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-25 18:22:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 18:22:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-11-25 18:22:51,414 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2022-11-25 18:22:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:51,417 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-11-25 18:22:51,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:22:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-11-25 18:22:51,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:22:51,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:51,425 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:51,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:22:51,425 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:51,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:51,426 INFO L85 PathProgramCache]: Analyzing trace with hash -192031447, now seen corresponding path program 1 times [2022-11-25 18:22:51,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:51,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315946293] [2022-11-25 18:22:51,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:51,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:53,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:53,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:22:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:53,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:22:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:22:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:53,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315946293] [2022-11-25 18:22:53,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315946293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:53,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:53,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:22:53,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172141967] [2022-11-25 18:22:53,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:53,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:22:53,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:53,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:22:53,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:22:53,443 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:22:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:53,926 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-11-25 18:22:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:22:53,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-11-25 18:22:53,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:53,930 INFO L225 Difference]: With dead ends: 56 [2022-11-25 18:22:53,930 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 18:22:53,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:22:53,932 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:53,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 262 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:22:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 18:22:53,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-11-25 18:22:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-25 18:22:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-11-25 18:22:53,947 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 28 [2022-11-25 18:22:53,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:53,948 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-11-25 18:22:53,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:22:53,948 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-11-25 18:22:53,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:22:53,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:53,949 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:53,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:22:53,950 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:53,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1001378073, now seen corresponding path program 1 times [2022-11-25 18:22:53,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:53,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418603382] [2022-11-25 18:22:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:53,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:54,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:54,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:22:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:54,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:22:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:54,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 18:22:54,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:54,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418603382] [2022-11-25 18:22:54,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418603382] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:22:54,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372250457] [2022-11-25 18:22:54,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:54,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:22:54,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:22:54,726 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:22:54,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:22:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:54,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-25 18:22:54,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:22:54,981 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 18:22:54,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:54,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:22:55,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 18:22:55,486 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-25 18:22:55,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 23 [2022-11-25 18:22:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:56,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:22:56,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 18:22:56,653 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-25 18:22:56,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-25 18:22:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:22:56,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372250457] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:22:56,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:22:56,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 12] total 31 [2022-11-25 18:22:56,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168600254] [2022-11-25 18:22:56,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:22:56,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 18:22:56,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:56,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 18:22:56,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2022-11-25 18:22:56,730 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 30 states have internal predecessors, (49), 7 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (9), 4 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-25 18:22:58,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:58,776 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-11-25 18:22:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:22:58,777 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 30 states have internal predecessors, (49), 7 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (9), 4 states have call predecessors, (9), 6 states have call successors, (9) Word has length 28 [2022-11-25 18:22:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:58,778 INFO L225 Difference]: With dead ends: 118 [2022-11-25 18:22:58,778 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 18:22:58,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=348, Invalid=1544, Unknown=0, NotChecked=0, Total=1892 [2022-11-25 18:22:58,781 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 136 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:58,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 426 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 18:22:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 18:22:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2022-11-25 18:22:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-25 18:22:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-11-25 18:22:58,809 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 28 [2022-11-25 18:22:58,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:58,809 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2022-11-25 18:22:58,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 30 states have internal predecessors, (49), 7 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (9), 4 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-25 18:22:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-11-25 18:22:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:22:58,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:58,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:58,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:22:59,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:22:59,023 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:59,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1394405083, now seen corresponding path program 1 times [2022-11-25 18:22:59,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:59,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498851703] [2022-11-25 18:22:59,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:59,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:59,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:59,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:22:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:59,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:22:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:22:59,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:59,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498851703] [2022-11-25 18:22:59,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498851703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:59,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:59,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:22:59,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719510268] [2022-11-25 18:22:59,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:59,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:22:59,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:59,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:22:59,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:22:59,264 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:22:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:59,308 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2022-11-25 18:22:59,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:22:59,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-11-25 18:22:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:59,310 INFO L225 Difference]: With dead ends: 128 [2022-11-25 18:22:59,311 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 18:22:59,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:22:59,313 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:59,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 139 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 18:22:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2022-11-25 18:22:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 40 states have internal predecessors, (45), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-25 18:22:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-11-25 18:22:59,327 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 28 [2022-11-25 18:22:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:59,328 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-11-25 18:22:59,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:22:59,329 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-11-25 18:22:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 18:22:59,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:59,330 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:59,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:22:59,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:59,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:59,331 INFO L85 PathProgramCache]: Analyzing trace with hash 854159971, now seen corresponding path program 1 times [2022-11-25 18:22:59,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:59,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618679531] [2022-11-25 18:22:59,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:59,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:00,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:00,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:23:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:00,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:23:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:00,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:23:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:00,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:23:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 18:23:01,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:01,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618679531] [2022-11-25 18:23:01,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618679531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:01,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:01,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:23:01,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064389617] [2022-11-25 18:23:01,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:01,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:23:01,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:01,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:23:01,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:23:01,031 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-25 18:23:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:01,435 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-11-25 18:23:01,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:23:01,436 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-11-25 18:23:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:01,437 INFO L225 Difference]: With dead ends: 69 [2022-11-25 18:23:01,437 INFO L226 Difference]: Without dead ends: 67 [2022-11-25 18:23:01,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:23:01,439 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 28 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:01,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 311 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:23:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-25 18:23:01,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-11-25 18:23:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-25 18:23:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-11-25 18:23:01,453 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 42 [2022-11-25 18:23:01,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:01,454 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-11-25 18:23:01,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-25 18:23:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-11-25 18:23:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 18:23:01,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:01,455 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:01,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:23:01,456 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:01,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:01,456 INFO L85 PathProgramCache]: Analyzing trace with hash 44813345, now seen corresponding path program 1 times [2022-11-25 18:23:01,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:01,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749988671] [2022-11-25 18:23:01,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:01,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:02,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:02,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:23:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:02,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:23:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:02,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:23:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:02,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:23:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 18:23:02,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:02,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749988671] [2022-11-25 18:23:02,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749988671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:02,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:02,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:23:02,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002231100] [2022-11-25 18:23:02,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:02,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:23:02,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:02,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:23:02,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:23:02,386 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:23:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:02,673 INFO L93 Difference]: Finished difference Result 112 states and 134 transitions. [2022-11-25 18:23:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:23:02,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-11-25 18:23:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:02,675 INFO L225 Difference]: With dead ends: 112 [2022-11-25 18:23:02,676 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 18:23:02,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:23:02,677 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 25 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:02,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 167 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:23:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 18:23:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-11-25 18:23:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2022-11-25 18:23:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2022-11-25 18:23:02,694 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 42 [2022-11-25 18:23:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:02,695 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2022-11-25 18:23:02,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:23:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-11-25 18:23:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 18:23:02,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:02,696 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:02,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:23:02,697 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:02,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:02,697 INFO L85 PathProgramCache]: Analyzing trace with hash -348213665, now seen corresponding path program 1 times [2022-11-25 18:23:02,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:02,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389418674] [2022-11-25 18:23:02,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:02,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:02,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:03,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:23:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:03,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:23:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:03,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:23:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:03,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:23:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:23:03,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:03,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389418674] [2022-11-25 18:23:03,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389418674] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:23:03,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043315542] [2022-11-25 18:23:03,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:03,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:23:03,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:23:03,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:23:03,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:23:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:03,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 18:23:03,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:23:03,437 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 18:23:03,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:23:03,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:23:03,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 18:23:04,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-11-25 18:23:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:04,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:23:04,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:23:04,381 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:23:04,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:23:04,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-25 18:23:04,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 18:23:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 18:23:04,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043315542] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:23:04,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:23:04,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 19 [2022-11-25 18:23:04,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399733099] [2022-11-25 18:23:04,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:04,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:23:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:04,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:23:04,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:23:04,425 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:23:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:04,627 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2022-11-25 18:23:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:23:04,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-11-25 18:23:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:04,629 INFO L225 Difference]: With dead ends: 123 [2022-11-25 18:23:04,629 INFO L226 Difference]: Without dead ends: 73 [2022-11-25 18:23:04,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:23:04,630 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 56 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:04,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 167 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:23:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-25 18:23:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-11-25 18:23:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 18:23:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-11-25 18:23:04,657 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 42 [2022-11-25 18:23:04,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:04,657 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-11-25 18:23:04,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:23:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-11-25 18:23:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 18:23:04,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:04,661 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:04,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:23:04,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:23:04,867 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:04,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:04,867 INFO L85 PathProgramCache]: Analyzing trace with hash -541770688, now seen corresponding path program 1 times [2022-11-25 18:23:04,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:04,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492208365] [2022-11-25 18:23:04,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:04,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:05,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:05,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:23:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:05,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:23:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:05,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:23:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:05,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:23:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:05,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:23:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 18:23:05,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:05,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492208365] [2022-11-25 18:23:05,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492208365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:05,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:05,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:23:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481795857] [2022-11-25 18:23:05,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:05,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:23:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:05,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:23:05,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:23:05,149 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:23:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:05,286 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-11-25 18:23:05,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:23:05,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-11-25 18:23:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:05,288 INFO L225 Difference]: With dead ends: 73 [2022-11-25 18:23:05,288 INFO L226 Difference]: Without dead ends: 71 [2022-11-25 18:23:05,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:23:05,290 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 10 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:05,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 210 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:23:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-25 18:23:05,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-25 18:23:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-25 18:23:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-11-25 18:23:05,323 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 48 [2022-11-25 18:23:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:05,324 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-11-25 18:23:05,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:23:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-11-25 18:23:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-25 18:23:05,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:05,330 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:05,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:23:05,331 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:05,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:05,331 INFO L85 PathProgramCache]: Analyzing trace with hash -266250434, now seen corresponding path program 1 times [2022-11-25 18:23:05,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:05,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097591942] [2022-11-25 18:23:05,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:05,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:06,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:06,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:23:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:06,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:23:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:06,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:23:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:06,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:23:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:06,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:23:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:06,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:23:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:06,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:23:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 18:23:06,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:06,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097591942] [2022-11-25 18:23:06,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097591942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:06,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:06,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:23:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769074885] [2022-11-25 18:23:06,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:06,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:23:06,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:06,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:23:06,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:23:06,937 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:23:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:07,278 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2022-11-25 18:23:07,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:23:07,280 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2022-11-25 18:23:07,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:07,281 INFO L225 Difference]: With dead ends: 82 [2022-11-25 18:23:07,281 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 18:23:07,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:23:07,282 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:07,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 286 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:23:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 18:23:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-11-25 18:23:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 57 states have internal predecessors, (61), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-25 18:23:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-11-25 18:23:07,306 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 63 [2022-11-25 18:23:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:07,306 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-11-25 18:23:07,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:23:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-11-25 18:23:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-25 18:23:07,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:07,309 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:07,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:23:07,309 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:07,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1075597060, now seen corresponding path program 1 times [2022-11-25 18:23:07,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:07,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311872649] [2022-11-25 18:23:07,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:07,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:07,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:07,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:23:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:07,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:23:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:07,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:23:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:07,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:23:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:07,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:23:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:07,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:23:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:07,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:23:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 18:23:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:08,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311872649] [2022-11-25 18:23:08,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311872649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:23:08,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557913550] [2022-11-25 18:23:08,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:08,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:23:08,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:23:08,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:23:08,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:23:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:08,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-25 18:23:08,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:23:08,333 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 18:23:08,339 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 18:23:08,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:23:08,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:23:08,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:23:08,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 18:23:08,779 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:23:08,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:23:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 18:23:09,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:23:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:23:10,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557913550] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:23:10,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:23:10,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 12] total 32 [2022-11-25 18:23:10,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864428689] [2022-11-25 18:23:10,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:23:10,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 18:23:10,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:10,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 18:23:10,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2022-11-25 18:23:10,621 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 32 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 31 states have internal predecessors, (91), 7 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2022-11-25 18:23:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:11,678 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2022-11-25 18:23:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:23:11,679 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 31 states have internal predecessors, (91), 7 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 63 [2022-11-25 18:23:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:11,680 INFO L225 Difference]: With dead ends: 106 [2022-11-25 18:23:11,680 INFO L226 Difference]: Without dead ends: 79 [2022-11-25 18:23:11,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 109 SyntacticMatches, 13 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 18:23:11,682 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 94 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:11,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 366 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 18:23:11,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-25 18:23:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2022-11-25 18:23:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 55 states have internal predecessors, (58), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-25 18:23:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-11-25 18:23:11,699 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 63 [2022-11-25 18:23:11,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:11,700 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-11-25 18:23:11,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 31 states have internal predecessors, (91), 7 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2022-11-25 18:23:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-11-25 18:23:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-25 18:23:11,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:11,702 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:11,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:23:11,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:23:11,910 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:11,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:11,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1468624070, now seen corresponding path program 1 times [2022-11-25 18:23:11,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:11,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541442141] [2022-11-25 18:23:11,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:11,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:12,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:12,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:23:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:12,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:23:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:23:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:12,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:23:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:12,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:23:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:12,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:23:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:12,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:23:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 18:23:12,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:12,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541442141] [2022-11-25 18:23:12,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541442141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:12,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:12,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:23:12,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625158392] [2022-11-25 18:23:12,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:12,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:23:12,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:23:12,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:23:12,190 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-25 18:23:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:12,215 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-11-25 18:23:12,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:23:12,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2022-11-25 18:23:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:12,217 INFO L225 Difference]: With dead ends: 105 [2022-11-25 18:23:12,217 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 18:23:12,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:23:12,218 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:12,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 143 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:23:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 18:23:12,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2022-11-25 18:23:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 46 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-25 18:23:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2022-11-25 18:23:12,230 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 63 [2022-11-25 18:23:12,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:12,231 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2022-11-25 18:23:12,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-25 18:23:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-11-25 18:23:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-25 18:23:12,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:12,232 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:12,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:23:12,232 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:12,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash 763050350, now seen corresponding path program 1 times [2022-11-25 18:23:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:12,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916785157] [2022-11-25 18:23:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:13,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:23:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:23:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:14,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:23:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:14,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:23:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:23:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:14,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:23:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:14,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:23:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:14,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 18:23:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:14,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:23:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-25 18:23:14,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:14,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916785157] [2022-11-25 18:23:14,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916785157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:14,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:14,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-25 18:23:14,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262399064] [2022-11-25 18:23:14,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:14,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:23:14,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:14,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:23:14,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:23:14,431 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-25 18:23:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:15,283 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-11-25 18:23:15,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:23:15,284 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 77 [2022-11-25 18:23:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:15,285 INFO L225 Difference]: With dead ends: 77 [2022-11-25 18:23:15,285 INFO L226 Difference]: Without dead ends: 75 [2022-11-25 18:23:15,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-11-25 18:23:15,286 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 37 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:15,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 312 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:23:15,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-25 18:23:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-11-25 18:23:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-11-25 18:23:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-11-25 18:23:15,305 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 77 [2022-11-25 18:23:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:15,306 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-11-25 18:23:15,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-25 18:23:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-11-25 18:23:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-25 18:23:15,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:15,312 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:15,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:23:15,313 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:15,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:15,316 INFO L85 PathProgramCache]: Analyzing trace with hash -46296276, now seen corresponding path program 1 times [2022-11-25 18:23:15,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:15,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494754539] [2022-11-25 18:23:15,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:15,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:16,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:16,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:23:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:16,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:23:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:16,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:23:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:23:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:16,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:23:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:16,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:23:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:23:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:16,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 18:23:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:16,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:23:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-25 18:23:16,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:16,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494754539] [2022-11-25 18:23:16,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494754539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:16,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:16,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:23:16,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924664684] [2022-11-25 18:23:16,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:16,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:23:16,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:16,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:23:16,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:23:16,565 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-25 18:23:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:17,035 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-11-25 18:23:17,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:23:17,036 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 77 [2022-11-25 18:23:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:17,037 INFO L225 Difference]: With dead ends: 86 [2022-11-25 18:23:17,037 INFO L226 Difference]: Without dead ends: 74 [2022-11-25 18:23:17,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:23:17,038 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 36 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:17,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 205 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:23:17,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-25 18:23:17,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-25 18:23:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-11-25 18:23:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-11-25 18:23:17,057 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 77 [2022-11-25 18:23:17,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:17,057 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-11-25 18:23:17,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-25 18:23:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-11-25 18:23:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-25 18:23:17,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:17,059 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:17,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:23:17,060 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:17,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:17,060 INFO L85 PathProgramCache]: Analyzing trace with hash -439323286, now seen corresponding path program 1 times [2022-11-25 18:23:17,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:17,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224643957] [2022-11-25 18:23:17,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:17,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:17,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:17,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:23:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:17,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:23:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:17,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:23:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:17,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:23:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:17,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:23:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:17,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:23:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:17,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:23:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:17,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 18:23:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:17,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:23:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-25 18:23:17,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:17,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224643957] [2022-11-25 18:23:17,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224643957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:23:17,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894858664] [2022-11-25 18:23:17,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:17,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:23:17,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:23:17,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:23:17,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:23:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:18,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 18:23:18,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:23:18,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 18:23:18,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 18:23:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-25 18:23:18,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:23:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-25 18:23:18,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894858664] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:23:18,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:23:18,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 15 [2022-11-25 18:23:18,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481989500] [2022-11-25 18:23:18,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:23:18,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 18:23:18,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:18,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 18:23:18,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:23:18,656 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-25 18:23:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:19,323 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-11-25 18:23:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:23:19,324 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 77 [2022-11-25 18:23:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:19,325 INFO L225 Difference]: With dead ends: 91 [2022-11-25 18:23:19,325 INFO L226 Difference]: Without dead ends: 67 [2022-11-25 18:23:19,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:23:19,327 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 37 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:19,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 347 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:23:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-25 18:23:19,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2022-11-25 18:23:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0) internal successors, (42), 42 states have internal predecessors, (42), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 18:23:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-11-25 18:23:19,345 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 77 [2022-11-25 18:23:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:19,345 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-11-25 18:23:19,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-25 18:23:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-11-25 18:23:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-25 18:23:19,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:19,347 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:19,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:23:19,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 18:23:19,555 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash 958151681, now seen corresponding path program 1 times [2022-11-25 18:23:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:19,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935427344] [2022-11-25 18:23:19,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:19,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:20,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:20,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:23:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:20,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:23:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:20,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:23:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:20,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:23:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:20,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:23:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:23:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:20,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:23:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 18:23:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:20,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:23:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:20,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 18:23:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-25 18:23:20,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:20,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935427344] [2022-11-25 18:23:20,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935427344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:20,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:20,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:23:20,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552899104] [2022-11-25 18:23:20,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:20,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:23:20,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:20,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:23:20,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:23:20,723 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-25 18:23:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:21,057 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-11-25 18:23:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:23:21,058 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 83 [2022-11-25 18:23:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:21,058 INFO L225 Difference]: With dead ends: 63 [2022-11-25 18:23:21,058 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 18:23:21,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:23:21,060 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:21,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 230 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:23:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 18:23:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 18:23:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 18:23:21,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2022-11-25 18:23:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:21,062 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 18:23:21,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-25 18:23:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 18:23:21,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 18:23:21,066 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 18:23:21,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:23:21,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 18:23:23,060 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validFINAL(lines 4717 4721) no Hoare annotation was computed. [2022-11-25 18:23:23,060 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2022-11-25 18:23:23,060 INFO L899 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2022-11-25 18:23:23,061 INFO L899 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2022-11-25 18:23:23,061 INFO L899 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2022-11-25 18:23:23,061 INFO L899 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2022-11-25 18:23:23,061 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_next_is_validENTRY(lines 4717 4721) the Hoare annotation is: true [2022-11-25 18:23:23,061 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validFINAL(lines 4728 4732) no Hoare annotation was computed. [2022-11-25 18:23:23,062 INFO L899 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2022-11-25 18:23:23,062 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2022-11-25 18:23:23,062 INFO L899 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2022-11-25 18:23:23,062 INFO L899 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2022-11-25 18:23:23,062 INFO L899 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2022-11-25 18:23:23,063 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_prev_is_validENTRY(lines 4728 4732) the Hoare annotation is: true [2022-11-25 18:23:23,063 INFO L899 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2022-11-25 18:23:23,063 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 18:23:23,063 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-11-25 18:23:23,064 INFO L902 garLoopResultBuilder]: At program point L7393(line 7393) the Hoare annotation is: true [2022-11-25 18:23:23,064 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2022-11-25 18:23:23,065 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_next_harness_#t~ret671#1|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (<= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret671#1| 1) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-11-25 18:23:23,065 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-11-25 18:23:23,065 INFO L895 garLoopResultBuilder]: At program point L4842(lines 4836 4843) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-11-25 18:23:23,066 INFO L895 garLoopResultBuilder]: At program point L4840-1(line 4840) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= |ULTIMATE.start_aws_linked_list_next_#t~ret330#1| 1) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_next_#t~ret330#1|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2022-11-25 18:23:23,066 INFO L899 garLoopResultBuilder]: For program point L4840-2(line 4840) no Hoare annotation was computed. [2022-11-25 18:23:23,066 INFO L895 garLoopResultBuilder]: At program point L4840(line 4840) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2022-11-25 18:23:23,067 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-11-25 18:23:23,067 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 18:23:23,067 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 18:23:23,067 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 18:23:23,068 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2022-11-25 18:23:23,068 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_next_harness_#t~ret672#1|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (<= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret672#1| 1) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-11-25 18:23:23,068 INFO L899 garLoopResultBuilder]: For program point L7376(lines 7376 7392) no Hoare annotation was computed. [2022-11-25 18:23:23,069 INFO L895 garLoopResultBuilder]: At program point L4839(line 4839) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2022-11-25 18:23:23,069 INFO L895 garLoopResultBuilder]: At program point L4839-1(line 4839) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= |ULTIMATE.start_aws_linked_list_next_#t~ret329#1| 1) (<= 1 |ULTIMATE.start_aws_linked_list_next_#t~ret329#1|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2022-11-25 18:23:23,069 INFO L895 garLoopResultBuilder]: At program point L4841(line 4841) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_#t~mem331#1.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| |ULTIMATE.start_aws_linked_list_next_#t~mem331#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2022-11-25 18:23:23,070 INFO L899 garLoopResultBuilder]: For program point L4841-1(line 4841) no Hoare annotation was computed. [2022-11-25 18:23:23,070 INFO L899 garLoopResultBuilder]: For program point L4837-2(line 4837) no Hoare annotation was computed. [2022-11-25 18:23:23,070 INFO L895 garLoopResultBuilder]: At program point L4837(line 4837) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (< 0 .cse0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) [2022-11-25 18:23:23,070 INFO L899 garLoopResultBuilder]: For program point L4839-2(line 4839) no Hoare annotation was computed. [2022-11-25 18:23:23,071 INFO L895 garLoopResultBuilder]: At program point L4837-1(line 4837) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (< 0 .cse0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) [2022-11-25 18:23:23,071 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-25 18:23:23,071 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-25 18:23:23,071 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-25 18:23:23,071 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-25 18:23:23,072 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-25 18:23:23,072 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-25 18:23:23,072 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-25 18:23:23,072 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-25 18:23:23,072 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-25 18:23:23,073 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-25 18:23:23,077 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:23,079 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:23:23,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,096 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 18:23:23,096 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 18:23:23,096 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 18:23:23,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,101 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,102 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 18:23:23,102 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 18:23:23,102 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,103 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 18:23:23,103 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,103 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:23:23 BoogieIcfgContainer [2022-11-25 18:23:23,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:23:23,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:23:23,107 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:23:23,107 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:23:23,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:22:50" (3/4) ... [2022-11-25 18:23:23,111 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 18:23:23,119 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2022-11-25 18:23:23,120 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2022-11-25 18:23:23,120 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-25 18:23:23,120 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-25 18:23:23,125 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-25 18:23:23,126 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-25 18:23:23,126 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 18:23:23,126 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:23:23,158 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((node == node && node == 0) && #memory_$Pointer$[node][node] == rval) && #memory_$Pointer$[rval][8] == node) && #memory_$Pointer$[rval][8] == 0) && \result == 0) && after == rval) && #memory_$Pointer$[node][node] == after) && !(node == after)) && after == \result) && 0 < rval) && #memory_$Pointer$[node][0] == 0) && \result == after) && 0 < unknown-#StackHeapBarrier-unknown + 1) && #memory_$Pointer$[rval][8] == node) && !(#memory_$Pointer$[\result][8] == 0) [2022-11-25 18:23:23,189 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:23:23,190 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:23:23,196 INFO L158 Benchmark]: Toolchain (without parser) took 36317.84ms. Allocated memory was 157.3MB in the beginning and 474.0MB in the end (delta: 316.7MB). Free memory was 118.3MB in the beginning and 151.2MB in the end (delta: -32.8MB). Peak memory consumption was 284.1MB. Max. memory is 16.1GB. [2022-11-25 18:23:23,197 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 123.7MB. Free memory was 93.8MB in the beginning and 93.7MB in the end (delta: 69.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:23:23,199 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2708.37ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 117.7MB in the beginning and 107.0MB in the end (delta: 10.7MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2022-11-25 18:23:23,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 134.64ms. Allocated memory is still 188.7MB. Free memory was 107.0MB in the beginning and 101.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 18:23:23,200 INFO L158 Benchmark]: Boogie Preprocessor took 85.80ms. Allocated memory is still 188.7MB. Free memory was 101.7MB in the beginning and 98.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:23:23,200 INFO L158 Benchmark]: RCFGBuilder took 644.21ms. Allocated memory is still 188.7MB. Free memory was 98.6MB in the beginning and 79.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 18:23:23,200 INFO L158 Benchmark]: TraceAbstraction took 32655.26ms. Allocated memory was 188.7MB in the beginning and 474.0MB in the end (delta: 285.2MB). Free memory was 78.7MB in the beginning and 154.3MB in the end (delta: -75.6MB). Peak memory consumption was 208.5MB. Max. memory is 16.1GB. [2022-11-25 18:23:23,201 INFO L158 Benchmark]: Witness Printer took 83.53ms. Allocated memory is still 474.0MB. Free memory was 154.3MB in the beginning and 151.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:23:23,209 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 123.7MB. Free memory was 93.8MB in the beginning and 93.7MB in the end (delta: 69.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2708.37ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 117.7MB in the beginning and 107.0MB in the end (delta: 10.7MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 134.64ms. Allocated memory is still 188.7MB. Free memory was 107.0MB in the beginning and 101.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.80ms. Allocated memory is still 188.7MB. Free memory was 101.7MB in the beginning and 98.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 644.21ms. Allocated memory is still 188.7MB. Free memory was 98.6MB in the beginning and 79.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 32655.26ms. Allocated memory was 188.7MB in the beginning and 474.0MB in the end (delta: 285.2MB). Free memory was 78.7MB in the beginning and 154.3MB in the end (delta: -75.6MB). Peak memory consumption was 208.5MB. Max. memory is 16.1GB. * Witness Printer took 83.53ms. Allocated memory is still 474.0MB. Free memory was 154.3MB in the beginning and 151.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.5s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 596 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 540 mSDsluCounter, 3632 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2915 mSDsCounter, 347 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2875 IncrementalHoareTripleChecker+Invalid, 3222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 347 mSolverCounterUnsat, 717 mSDtfsCounter, 2875 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 806 GetRequests, 561 SyntacticMatches, 19 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=9, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 31 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 89 PreInvPairs, 102 NumberOfFragments, 1104 HoareAnnotationTreeSize, 89 FomulaSimplifications, 479 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 2308 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 999 NumberOfCodeBlocks, 999 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1186 ConstructedInterpolants, 73 QuantifiedInterpolants, 7597 SizeOfPredicates, 70 NumberOfNonLiveVariables, 1096 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 23 InterpolantComputations, 12 PerfectInterpolantSequences, 584/675 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7393]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4836]: Loop Invariant [2022-11-25 18:23:23,223 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,224 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 18:23:23,224 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 18:23:23,224 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,229 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 18:23:23,230 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,230 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,231 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 18:23:23,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 18:23:23,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 18:23:23,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:23:23,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((node == node && node == 0) && #memory_$Pointer$[node][node] == rval) && #memory_$Pointer$[rval][8] == node) && #memory_$Pointer$[rval][8] == 0) && \result == 0) && after == rval) && #memory_$Pointer$[node][node] == after) && !(node == after)) && after == \result) && 0 < rval) && #memory_$Pointer$[node][0] == 0) && \result == after) && 0 < unknown-#StackHeapBarrier-unknown + 1) && #memory_$Pointer$[rval][8] == node) && !(#memory_$Pointer$[\result][8] == 0) RESULT: Ultimate proved your program to be correct! [2022-11-25 18:23:23,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dae6b9-0463-4f42-a4f3-dae2d08dc992/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE