./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/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_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/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_51ac1e91-a740-4d9d-bd9b-1de456540c04/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 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- 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 17:03:11,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:03:11,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:03:11,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:03:11,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:03:11,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:03:11,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:03:11,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:03:11,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:03:11,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:03:11,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:03:11,315 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:03:11,315 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:03:11,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:03:11,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:03:11,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:03:11,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:03:11,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:03:11,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:03:11,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:03:11,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:03:11,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:03:11,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:03:11,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:03:11,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:03:11,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:03:11,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:03:11,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:03:11,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:03:11,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:03:11,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:03:11,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:03:11,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:03:11,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:03:11,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:03:11,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:03:11,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:03:11,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:03:11,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:03:11,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:03:11,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:03:11,359 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 17:03:11,405 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:03:11,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:03:11,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:03:11,411 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:03:11,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:03:11,413 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:03:11,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:03:11,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:03:11,415 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:03:11,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:03:11,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:03:11,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:03:11,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:03:11,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:03:11,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:03:11,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:03:11,418 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:03:11,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:03:11,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:03:11,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:03:11,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:03:11,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:03:11,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:03:11,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:03:11,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:03:11,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:03:11,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:03:11,422 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:03:11,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:03:11,422 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:03:11,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:03:11,423 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_51ac1e91-a740-4d9d-bd9b-1de456540c04/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_51ac1e91-a740-4d9d-bd9b-1de456540c04/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 -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2022-11-25 17:03:11,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:03:11,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:03:11,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:03:11,877 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:03:11,878 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:03:11,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-25 17:03:15,621 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:03:16,214 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:03:16,215 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-25 17:03:16,258 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/data/d15751743/5554616f90004276b8f70ffecb22cf72/FLAG832ce8f2b [2022-11-25 17:03:16,284 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/data/d15751743/5554616f90004276b8f70ffecb22cf72 [2022-11-25 17:03:16,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:03:16,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:03:16,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:03:16,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:03:16,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:03:16,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:03:16" (1/1) ... [2022-11-25 17:03:16,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e589a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:16, skipping insertion in model container [2022-11-25 17:03:16,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:03:16" (1/1) ... [2022-11-25 17:03:16,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:03:16,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:03:17,162 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 17:03:17,172 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 17:03:17,224 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:17,368 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-11-25 17:03:17,375 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-11-25 17:03:17,389 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:03:17,393 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:03:17,397 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:03:17,441 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 17:03:17,465 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-11-25 17:03:17,479 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-11-25 17:03:17,520 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-11-25 17:03:17,522 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:03:17,523 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:03:17,524 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:03:17,531 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:03:17,541 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:03:17,541 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:03:17,543 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:03:17,548 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:03:17,548 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:03:17,552 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-11-25 17:03:17,554 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-11-25 17:03:17,555 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-11-25 17:03:17,556 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 17:03:17,563 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-11-25 17:03:17,566 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-11-25 17:03:17,568 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 17:03:17,575 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 17:03:17,595 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-11-25 17:03:17,605 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-11-25 17:03:17,608 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_urb [2022-11-25 17:03:17,611 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-11-25 17:03:17,612 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-11-25 17:03:17,617 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_51ac1e91-a740-4d9d-bd9b-1de456540c04/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-11-25 17:03:17,632 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:17,637 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:17,655 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:17,685 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:17,690 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:17,691 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:17,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:03:17,728 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:03:17,883 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 17:03:17,886 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 17:03:17,896 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:17,908 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-11-25 17:03:17,908 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-11-25 17:03:17,910 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:03:17,911 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:03:17,912 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:03:17,931 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 17:03:17,935 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-11-25 17:03:17,941 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-11-25 17:03:17,944 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-11-25 17:03:17,946 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:03:17,948 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:03:17,949 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:03:17,962 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:03:17,963 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:03:17,963 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:03:17,965 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:03:17,965 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:03:17,966 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:03:17,969 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-11-25 17:03:17,970 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-11-25 17:03:17,971 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-11-25 17:03:17,972 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 17:03:17,973 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-11-25 17:03:17,973 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-11-25 17:03:17,974 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 17:03:17,982 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 17:03:17,984 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-11-25 17:03:17,993 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-11-25 17:03:17,995 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_urb [2022-11-25 17:03:17,997 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-11-25 17:03:17,998 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-11-25 17:03:17,999 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_51ac1e91-a740-4d9d-bd9b-1de456540c04/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-11-25 17:03:18,006 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:18,010 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:18,016 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:18,029 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:18,031 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:18,033 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:03:18,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:03:18,080 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:03:18,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:18 WrapperNode [2022-11-25 17:03:18,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:03:18,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:03:18,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:03:18,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:03:18,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:18" (1/1) ... [2022-11-25 17:03:18,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:18" (1/1) ... [2022-11-25 17:03:18,237 INFO L138 Inliner]: procedures = 109, calls = 318, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 800 [2022-11-25 17:03:18,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:03:18,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:03:18,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:03:18,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:03:18,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:18" (1/1) ... [2022-11-25 17:03:18,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:18" (1/1) ... [2022-11-25 17:03:18,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:18" (1/1) ... [2022-11-25 17:03:18,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:18" (1/1) ... [2022-11-25 17:03:18,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:18" (1/1) ... [2022-11-25 17:03:18,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:18" (1/1) ... [2022-11-25 17:03:18,353 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:18" (1/1) ... [2022-11-25 17:03:18,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:18" (1/1) ... [2022-11-25 17:03:18,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:03:18,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:03:18,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:03:18,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:03:18,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:18" (1/1) ... [2022-11-25 17:03:18,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:03:18,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:03:18,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:03:18,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:03:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-25 17:03:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-25 17:03:18,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:03:18,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-25 17:03:18,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-25 17:03:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-25 17:03:18,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-25 17:03:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-25 17:03:18,494 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-25 17:03:18,494 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-25 17:03:18,494 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-25 17:03:18,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:03:18,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-25 17:03:18,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-25 17:03:18,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-25 17:03:18,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-25 17:03:18,496 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-11-25 17:03:18,496 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-11-25 17:03:18,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-25 17:03:18,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-25 17:03:18,496 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 17:03:18,497 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 17:03:18,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:03:18,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:03:18,497 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-25 17:03:18,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-25 17:03:18,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 17:03:18,498 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-25 17:03:18,498 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-25 17:03:18,498 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-25 17:03:18,498 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-25 17:03:18,498 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-11-25 17:03:18,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-11-25 17:03:18,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 17:03:18,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:03:18,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 17:03:18,500 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-25 17:03:18,501 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-25 17:03:18,505 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-25 17:03:18,505 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-25 17:03:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:03:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:03:18,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:03:19,018 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:03:19,021 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:03:19,123 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-25 17:03:19,997 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:03:20,008 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:03:20,008 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 17:03:20,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:03:20 BoogieIcfgContainer [2022-11-25 17:03:20,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:03:20,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:03:20,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:03:20,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:03:20,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:03:16" (1/3) ... [2022-11-25 17:03:20,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34098129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:03:20, skipping insertion in model container [2022-11-25 17:03:20,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:18" (2/3) ... [2022-11-25 17:03:20,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34098129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:03:20, skipping insertion in model container [2022-11-25 17:03:20,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:03:20" (3/3) ... [2022-11-25 17:03:20,054 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-25 17:03:20,084 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:03:20,084 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:03:20,193 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:03:20,204 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;@3d2b1e8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:03:20,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:03:20,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 186 states have internal predecessors, (232), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-11-25 17:03:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 17:03:20,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:20,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:20,225 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:20,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:20,232 INFO L85 PathProgramCache]: Analyzing trace with hash -914963392, now seen corresponding path program 1 times [2022-11-25 17:03:20,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:20,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055962971] [2022-11-25 17:03:20,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:20,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:20,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:20,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:20,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:20,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:20,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055962971] [2022-11-25 17:03:20,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055962971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:20,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:20,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:03:20,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061122078] [2022-11-25 17:03:20,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:20,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:03:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:20,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:03:20,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:03:20,995 INFO L87 Difference]: Start difference. First operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 186 states have internal predecessors, (232), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 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 17:03:21,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:21,745 INFO L93 Difference]: Finished difference Result 472 states and 646 transitions. [2022-11-25 17:03:21,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:03:21,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 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 32 [2022-11-25 17:03:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:21,772 INFO L225 Difference]: With dead ends: 472 [2022-11-25 17:03:21,773 INFO L226 Difference]: Without dead ends: 231 [2022-11-25 17:03:21,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:03:21,796 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 94 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:21,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 413 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:03:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-25 17:03:21,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2022-11-25 17:03:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 175 states have internal predecessors, (220), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-25 17:03:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 294 transitions. [2022-11-25 17:03:21,901 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 294 transitions. Word has length 32 [2022-11-25 17:03:21,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:21,902 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 294 transitions. [2022-11-25 17:03:21,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 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 17:03:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 294 transitions. [2022-11-25 17:03:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 17:03:21,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:21,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:21,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:03:21,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:21,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:21,908 INFO L85 PathProgramCache]: Analyzing trace with hash -492261566, now seen corresponding path program 1 times [2022-11-25 17:03:21,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:21,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333457207] [2022-11-25 17:03:21,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:22,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:22,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:22,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:22,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333457207] [2022-11-25 17:03:22,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333457207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:22,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:22,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:03:22,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474856277] [2022-11-25 17:03:22,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:22,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:03:22,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:22,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:03:22,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:03:22,267 INFO L87 Difference]: Start difference. First operand 224 states and 294 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:03:23,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:23,327 INFO L93 Difference]: Finished difference Result 652 states and 865 transitions. [2022-11-25 17:03:23,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:03:23,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-25 17:03:23,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:23,333 INFO L225 Difference]: With dead ends: 652 [2022-11-25 17:03:23,333 INFO L226 Difference]: Without dead ends: 433 [2022-11-25 17:03:23,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:03:23,336 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 326 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:23,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 772 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 17:03:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-11-25 17:03:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 419. [2022-11-25 17:03:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 318 states have (on average 1.2893081761006289) internal successors, (410), 325 states have internal predecessors, (410), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-25 17:03:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 550 transitions. [2022-11-25 17:03:23,383 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 550 transitions. Word has length 32 [2022-11-25 17:03:23,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:23,384 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 550 transitions. [2022-11-25 17:03:23,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:03:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 550 transitions. [2022-11-25 17:03:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 17:03:23,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:23,387 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:23,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:03:23,388 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash 453727969, now seen corresponding path program 1 times [2022-11-25 17:03:23,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:23,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226978310] [2022-11-25 17:03:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:23,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:23,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:23,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:23,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:23,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:03:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:23,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:03:23,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:23,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226978310] [2022-11-25 17:03:23,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226978310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:23,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:23,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:03:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022404747] [2022-11-25 17:03:23,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:23,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:03:23,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:23,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:03:23,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:03:23,790 INFO L87 Difference]: Start difference. First operand 419 states and 550 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:03:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:24,816 INFO L93 Difference]: Finished difference Result 990 states and 1341 transitions. [2022-11-25 17:03:24,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:03:24,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-11-25 17:03:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:24,822 INFO L225 Difference]: With dead ends: 990 [2022-11-25 17:03:24,822 INFO L226 Difference]: Without dead ends: 586 [2022-11-25 17:03:24,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:03:24,825 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 672 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:24,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1183 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 17:03:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-11-25 17:03:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 422. [2022-11-25 17:03:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 321 states have (on average 1.2834890965732086) internal successors, (412), 328 states have internal predecessors, (412), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-25 17:03:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 552 transitions. [2022-11-25 17:03:24,878 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 552 transitions. Word has length 55 [2022-11-25 17:03:24,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:24,879 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 552 transitions. [2022-11-25 17:03:24,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:03:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 552 transitions. [2022-11-25 17:03:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 17:03:24,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:24,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:24,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:03:24,883 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:24,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1191044641, now seen corresponding path program 1 times [2022-11-25 17:03:24,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:24,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988138785] [2022-11-25 17:03:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:24,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:25,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:25,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:25,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:25,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:03:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:25,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:25,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:03:25,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:25,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988138785] [2022-11-25 17:03:25,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988138785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:25,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:25,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:03:25,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116718317] [2022-11-25 17:03:25,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:25,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:03:25,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:25,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:03:25,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:03:25,076 INFO L87 Difference]: Start difference. First operand 422 states and 552 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:03:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:26,029 INFO L93 Difference]: Finished difference Result 1257 states and 1665 transitions. [2022-11-25 17:03:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:03:26,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2022-11-25 17:03:26,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:26,040 INFO L225 Difference]: With dead ends: 1257 [2022-11-25 17:03:26,041 INFO L226 Difference]: Without dead ends: 850 [2022-11-25 17:03:26,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:03:26,046 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 401 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:26,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 714 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 17:03:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2022-11-25 17:03:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 820. [2022-11-25 17:03:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 628 states have (on average 1.2786624203821657) internal successors, (803), 639 states have internal predecessors, (803), 137 states have call successors, (137), 55 states have call predecessors, (137), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-25 17:03:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1073 transitions. [2022-11-25 17:03:26,182 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1073 transitions. Word has length 55 [2022-11-25 17:03:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:26,183 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1073 transitions. [2022-11-25 17:03:26,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:03:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1073 transitions. [2022-11-25 17:03:26,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 17:03:26,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:26,195 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:26,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:03:26,196 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:26,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:26,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1732311739, now seen corresponding path program 1 times [2022-11-25 17:03:26,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:26,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981104470] [2022-11-25 17:03:26,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:26,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:26,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:26,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:03:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:26,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:26,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:03:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:26,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981104470] [2022-11-25 17:03:26,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981104470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:26,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:26,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:03:26,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741588640] [2022-11-25 17:03:26,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:26,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:03:26,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:26,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:03:26,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:03:26,444 INFO L87 Difference]: Start difference. First operand 820 states and 1073 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:03:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:27,060 INFO L93 Difference]: Finished difference Result 850 states and 1122 transitions. [2022-11-25 17:03:27,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:03:27,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-11-25 17:03:27,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:27,066 INFO L225 Difference]: With dead ends: 850 [2022-11-25 17:03:27,066 INFO L226 Difference]: Without dead ends: 847 [2022-11-25 17:03:27,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:03:27,068 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 285 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:27,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 539 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:03:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2022-11-25 17:03:27,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 819. [2022-11-25 17:03:27,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 628 states have (on average 1.2770700636942676) internal successors, (802), 638 states have internal predecessors, (802), 136 states have call successors, (136), 55 states have call predecessors, (136), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-25 17:03:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1071 transitions. [2022-11-25 17:03:27,165 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1071 transitions. Word has length 56 [2022-11-25 17:03:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:27,168 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1071 transitions. [2022-11-25 17:03:27,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:03:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1071 transitions. [2022-11-25 17:03:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 17:03:27,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:27,171 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:27,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:03:27,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:27,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2132925860, now seen corresponding path program 1 times [2022-11-25 17:03:27,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:27,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352962874] [2022-11-25 17:03:27,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:27,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:27,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:27,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:27,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:27,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:03:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:27,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:27,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:03:27,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:27,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352962874] [2022-11-25 17:03:27,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352962874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:27,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:27,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:03:27,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662975043] [2022-11-25 17:03:27,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:27,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:03:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:27,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:03:27,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:03:27,404 INFO L87 Difference]: Start difference. First operand 819 states and 1071 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:03:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:27,885 INFO L93 Difference]: Finished difference Result 849 states and 1120 transitions. [2022-11-25 17:03:27,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:03:27,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-11-25 17:03:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:27,892 INFO L225 Difference]: With dead ends: 849 [2022-11-25 17:03:27,892 INFO L226 Difference]: Without dead ends: 846 [2022-11-25 17:03:27,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:03:27,894 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 322 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:27,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 384 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:03:27,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2022-11-25 17:03:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 818. [2022-11-25 17:03:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 628 states have (on average 1.2754777070063694) internal successors, (801), 637 states have internal predecessors, (801), 135 states have call successors, (135), 55 states have call predecessors, (135), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-25 17:03:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1069 transitions. [2022-11-25 17:03:27,981 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1069 transitions. Word has length 57 [2022-11-25 17:03:27,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:27,982 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1069 transitions. [2022-11-25 17:03:27,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:03:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1069 transitions. [2022-11-25 17:03:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 17:03:27,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:27,984 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:27,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:03:27,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1696212008, now seen corresponding path program 1 times [2022-11-25 17:03:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:27,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88520557] [2022-11-25 17:03:27,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:27,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:28,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:28,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:28,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:03:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:28,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:28,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:03:28,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:28,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88520557] [2022-11-25 17:03:28,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88520557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:28,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:28,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:03:28,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372543462] [2022-11-25 17:03:28,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:28,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:03:28,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:28,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:03:28,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:03:28,201 INFO L87 Difference]: Start difference. First operand 818 states and 1069 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:03:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:28,770 INFO L93 Difference]: Finished difference Result 848 states and 1118 transitions. [2022-11-25 17:03:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:03:28,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-11-25 17:03:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:28,776 INFO L225 Difference]: With dead ends: 848 [2022-11-25 17:03:28,777 INFO L226 Difference]: Without dead ends: 837 [2022-11-25 17:03:28,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:03:28,779 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 319 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:28,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 383 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:03:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2022-11-25 17:03:28,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 809. [2022-11-25 17:03:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 620 states have (on average 1.2741935483870968) internal successors, (790), 628 states have internal predecessors, (790), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-25 17:03:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1057 transitions. [2022-11-25 17:03:28,869 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1057 transitions. Word has length 58 [2022-11-25 17:03:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:28,869 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1057 transitions. [2022-11-25 17:03:28,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:03:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1057 transitions. [2022-11-25 17:03:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-25 17:03:28,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:28,874 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:28,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:03:28,874 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:28,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:28,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1715867054, now seen corresponding path program 1 times [2022-11-25 17:03:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:28,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895735013] [2022-11-25 17:03:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:03:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:03:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 17:03:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:03:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:03:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 17:03:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 17:03:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:03:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-25 17:03:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 17:03:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-25 17:03:29,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:29,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895735013] [2022-11-25 17:03:29,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895735013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:29,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:29,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:03:29,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494473884] [2022-11-25 17:03:29,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:29,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:03:29,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:29,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:03:29,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:03:29,339 INFO L87 Difference]: Start difference. First operand 809 states and 1057 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:03:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:29,974 INFO L93 Difference]: Finished difference Result 1695 states and 2233 transitions. [2022-11-25 17:03:29,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:03:29,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 154 [2022-11-25 17:03:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:29,980 INFO L225 Difference]: With dead ends: 1695 [2022-11-25 17:03:29,981 INFO L226 Difference]: Without dead ends: 901 [2022-11-25 17:03:29,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:03:29,984 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 147 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:29,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 734 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:03:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-11-25 17:03:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 863. [2022-11-25 17:03:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 673 states have (on average 1.2838038632986628) internal successors, (864), 681 states have internal predecessors, (864), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-25 17:03:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1131 transitions. [2022-11-25 17:03:30,072 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1131 transitions. Word has length 154 [2022-11-25 17:03:30,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:30,073 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 1131 transitions. [2022-11-25 17:03:30,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:03:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1131 transitions. [2022-11-25 17:03:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-25 17:03:30,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:30,078 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:30,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:03:30,078 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:30,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:30,079 INFO L85 PathProgramCache]: Analyzing trace with hash 281231005, now seen corresponding path program 1 times [2022-11-25 17:03:30,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:30,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381946232] [2022-11-25 17:03:30,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:30,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:03:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:03:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 17:03:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 17:03:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:03:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-25 17:03:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 17:03:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 17:03:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-25 17:03:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:03:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-25 17:03:30,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:30,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381946232] [2022-11-25 17:03:30,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381946232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:30,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:30,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 17:03:30,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79248429] [2022-11-25 17:03:30,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:30,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:03:30,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:30,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:03:30,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:03:30,546 INFO L87 Difference]: Start difference. First operand 863 states and 1131 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:03:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:31,339 INFO L93 Difference]: Finished difference Result 2305 states and 3112 transitions. [2022-11-25 17:03:31,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:03:31,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 163 [2022-11-25 17:03:31,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:31,351 INFO L225 Difference]: With dead ends: 2305 [2022-11-25 17:03:31,352 INFO L226 Difference]: Without dead ends: 1461 [2022-11-25 17:03:31,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:03:31,360 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 455 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:31,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1773 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:03:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2022-11-25 17:03:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 875. [2022-11-25 17:03:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 685 states have (on average 1.2788321167883212) internal successors, (876), 693 states have internal predecessors, (876), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-25 17:03:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1143 transitions. [2022-11-25 17:03:31,511 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1143 transitions. Word has length 163 [2022-11-25 17:03:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:31,512 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1143 transitions. [2022-11-25 17:03:31,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:03:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1143 transitions. [2022-11-25 17:03:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-11-25 17:03:31,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:31,518 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:31,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:03:31,519 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:31,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1992328740, now seen corresponding path program 1 times [2022-11-25 17:03:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:31,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513898378] [2022-11-25 17:03:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:31,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:31,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:31,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:31,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:31,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:03:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:31,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:31,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:31,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:03:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 17:03:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:03:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:32,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:03:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:32,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:32,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 17:03:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:32,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:32,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 17:03:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:32,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 17:03:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:32,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:03:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:32,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-25 17:03:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-25 17:03:32,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:32,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513898378] [2022-11-25 17:03:32,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513898378] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:03:32,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656294732] [2022-11-25 17:03:32,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:32,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:03:32,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:03:32,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:03:32,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:03:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:32,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:03:32,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:03:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-25 17:03:32,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:03:32,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656294732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:32,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:03:32,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-25 17:03:32,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482490148] [2022-11-25 17:03:32,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:32,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:03:32,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:32,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:03:32,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:03:32,813 INFO L87 Difference]: Start difference. First operand 875 states and 1143 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:03:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:33,356 INFO L93 Difference]: Finished difference Result 2833 states and 3730 transitions. [2022-11-25 17:03:33,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:03:33,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 165 [2022-11-25 17:03:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:33,369 INFO L225 Difference]: With dead ends: 2833 [2022-11-25 17:03:33,369 INFO L226 Difference]: Without dead ends: 1977 [2022-11-25 17:03:33,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:03:33,374 INFO L413 NwaCegarLoop]: 592 mSDtfsCounter, 400 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:33,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1908 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:03:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2022-11-25 17:03:33,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 911. [2022-11-25 17:03:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 713 states have (on average 1.2678821879382889) internal successors, (904), 721 states have internal predecessors, (904), 142 states have call successors, (142), 56 states have call predecessors, (142), 55 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-11-25 17:03:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1187 transitions. [2022-11-25 17:03:33,517 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1187 transitions. Word has length 165 [2022-11-25 17:03:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:33,517 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1187 transitions. [2022-11-25 17:03:33,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:03:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1187 transitions. [2022-11-25 17:03:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-11-25 17:03:33,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:33,522 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:33,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:03:33,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 17:03:33,739 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:33,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash 981211490, now seen corresponding path program 1 times [2022-11-25 17:03:33,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:33,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952618190] [2022-11-25 17:03:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:03:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:03:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 17:03:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:03:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:03:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 17:03:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 17:03:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 17:03:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:03:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-25 17:03:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-25 17:03:34,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:34,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952618190] [2022-11-25 17:03:34,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952618190] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:03:34,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104075138] [2022-11-25 17:03:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:34,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:03:34,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:03:34,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:03:34,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:03:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:35,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 17:03:35,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:03:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-25 17:03:35,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:03:35,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104075138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:35,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:03:35,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-11-25 17:03:35,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605064612] [2022-11-25 17:03:35,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:35,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:03:35,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:35,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:03:35,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:03:35,246 INFO L87 Difference]: Start difference. First operand 911 states and 1187 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:03:35,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:35,432 INFO L93 Difference]: Finished difference Result 1831 states and 2411 transitions. [2022-11-25 17:03:35,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:03:35,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 165 [2022-11-25 17:03:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:35,439 INFO L225 Difference]: With dead ends: 1831 [2022-11-25 17:03:35,439 INFO L226 Difference]: Without dead ends: 939 [2022-11-25 17:03:35,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:03:35,443 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 1 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:35,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1132 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:03:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-11-25 17:03:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 927. [2022-11-25 17:03:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 725 states have (on average 1.2634482758620689) internal successors, (916), 733 states have internal predecessors, (916), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 145 states have call predecessors, (161), 141 states have call successors, (161) [2022-11-25 17:03:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1219 transitions. [2022-11-25 17:03:35,569 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1219 transitions. Word has length 165 [2022-11-25 17:03:35,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:35,570 INFO L495 AbstractCegarLoop]: Abstraction has 927 states and 1219 transitions. [2022-11-25 17:03:35,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:03:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1219 transitions. [2022-11-25 17:03:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-25 17:03:35,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:35,575 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:35,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:03:35,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:03:35,788 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:35,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:35,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1506840738, now seen corresponding path program 1 times [2022-11-25 17:03:35,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:35,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601107376] [2022-11-25 17:03:35,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:35,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:36,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:36,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:36,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:36,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:03:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:36,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:36,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:03:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:36,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:03:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:36,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:03:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:36,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 17:03:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:37,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:37,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 17:03:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:37,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:37,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 17:03:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:37,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 17:03:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:37,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-25 17:03:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:37,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-25 17:03:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-25 17:03:37,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:37,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601107376] [2022-11-25 17:03:37,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601107376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:03:37,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122804191] [2022-11-25 17:03:37,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:37,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:03:37,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:03:37,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:03:37,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:03:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:38,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-25 17:03:38,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:03:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-25 17:03:38,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:03:38,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122804191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:38,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:03:38,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 18 [2022-11-25 17:03:38,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744170527] [2022-11-25 17:03:38,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:38,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:03:38,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:38,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:03:38,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-11-25 17:03:38,525 INFO L87 Difference]: Start difference. First operand 927 states and 1219 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 17:03:39,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:39,820 INFO L93 Difference]: Finished difference Result 3347 states and 4705 transitions. [2022-11-25 17:03:39,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 17:03:39,821 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2022-11-25 17:03:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:39,836 INFO L225 Difference]: With dead ends: 3347 [2022-11-25 17:03:39,836 INFO L226 Difference]: Without dead ends: 2889 [2022-11-25 17:03:39,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-11-25 17:03:39,840 INFO L413 NwaCegarLoop]: 575 mSDtfsCounter, 841 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 3554 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:39,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 3554 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:03:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2022-11-25 17:03:40,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 939. [2022-11-25 17:03:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 737 states have (on average 1.2591587516960652) internal successors, (928), 741 states have internal predecessors, (928), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-11-25 17:03:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1231 transitions. [2022-11-25 17:03:40,129 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1231 transitions. Word has length 171 [2022-11-25 17:03:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:40,130 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1231 transitions. [2022-11-25 17:03:40,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 17:03:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1231 transitions. [2022-11-25 17:03:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-25 17:03:40,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:40,135 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:40,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:03:40,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 17:03:40,345 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:40,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:40,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1514027366, now seen corresponding path program 2 times [2022-11-25 17:03:40,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:40,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055811279] [2022-11-25 17:03:40,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:40,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:03:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:03:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:03:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:03:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 17:03:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 17:03:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 17:03:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 17:03:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-25 17:03:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-25 17:03:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-25 17:03:41,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:41,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055811279] [2022-11-25 17:03:41,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055811279] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:03:41,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491145743] [2022-11-25 17:03:41,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:03:41,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:03:41,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:03:41,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:03:41,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:03:42,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:03:42,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:03:42,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 17:03:42,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:03:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-25 17:03:42,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:03:42,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491145743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:42,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:03:42,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-11-25 17:03:42,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711522268] [2022-11-25 17:03:42,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:42,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:03:42,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:42,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:03:42,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:03:42,395 INFO L87 Difference]: Start difference. First operand 939 states and 1231 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 17:03:43,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:43,083 INFO L93 Difference]: Finished difference Result 1903 states and 2581 transitions. [2022-11-25 17:03:43,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:03:43,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 177 [2022-11-25 17:03:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:43,092 INFO L225 Difference]: With dead ends: 1903 [2022-11-25 17:03:43,092 INFO L226 Difference]: Without dead ends: 1439 [2022-11-25 17:03:43,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:03:43,095 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 572 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:43,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1976 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:03:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2022-11-25 17:03:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 945. [2022-11-25 17:03:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 743 states have (on average 1.2570659488559892) internal successors, (934), 747 states have internal predecessors, (934), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-11-25 17:03:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1237 transitions. [2022-11-25 17:03:43,337 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1237 transitions. Word has length 177 [2022-11-25 17:03:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:43,338 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1237 transitions. [2022-11-25 17:03:43,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 17:03:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1237 transitions. [2022-11-25 17:03:43,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-25 17:03:43,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:43,344 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:43,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:03:43,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 17:03:43,553 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:43,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:43,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1738426959, now seen corresponding path program 1 times [2022-11-25 17:03:43,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:43,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307234771] [2022-11-25 17:03:43,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:43,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:03:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:03:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:03:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:03:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 17:03:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 17:03:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 17:03:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 17:03:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-25 17:03:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-25 17:03:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-25 17:03:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-25 17:03:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-25 17:03:44,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:44,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307234771] [2022-11-25 17:03:44,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307234771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:03:44,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94297061] [2022-11-25 17:03:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:44,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:03:44,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:03:44,238 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:03:44,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:03:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 1823 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:03:44,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:03:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-25 17:03:45,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:03:45,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94297061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:45,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:03:45,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-11-25 17:03:45,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530909706] [2022-11-25 17:03:45,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:45,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:03:45,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:45,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:03:45,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:03:45,308 INFO L87 Difference]: Start difference. First operand 945 states and 1237 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 17:03:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:46,227 INFO L93 Difference]: Finished difference Result 2799 states and 3674 transitions. [2022-11-25 17:03:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:03:46,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 205 [2022-11-25 17:03:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:46,242 INFO L225 Difference]: With dead ends: 2799 [2022-11-25 17:03:46,242 INFO L226 Difference]: Without dead ends: 2791 [2022-11-25 17:03:46,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:03:46,245 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 412 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:46,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1065 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:03:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2022-11-25 17:03:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2777. [2022-11-25 17:03:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 2187 states have (on average 1.2610882487425696) internal successors, (2758), 2203 states have internal predecessors, (2758), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 437 states have call predecessors, (477), 417 states have call successors, (477) [2022-11-25 17:03:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3653 transitions. [2022-11-25 17:03:47,054 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3653 transitions. Word has length 205 [2022-11-25 17:03:47,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:47,055 INFO L495 AbstractCegarLoop]: Abstraction has 2777 states and 3653 transitions. [2022-11-25 17:03:47,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 17:03:47,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3653 transitions. [2022-11-25 17:03:47,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-25 17:03:47,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:47,063 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:47,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:03:47,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:03:47,274 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:47,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:47,275 INFO L85 PathProgramCache]: Analyzing trace with hash 727309709, now seen corresponding path program 1 times [2022-11-25 17:03:47,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:47,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073932296] [2022-11-25 17:03:47,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:47,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:03:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:03:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:03:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:03:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 17:03:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 17:03:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 17:03:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 17:03:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-25 17:03:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-25 17:03:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-25 17:03:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-25 17:03:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-25 17:03:47,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:47,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073932296] [2022-11-25 17:03:47,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073932296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:47,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:47,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:03:47,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460152700] [2022-11-25 17:03:47,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:47,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:03:47,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:47,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:03:47,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:03:47,837 INFO L87 Difference]: Start difference. First operand 2777 states and 3653 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-25 17:03:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:03:50,448 INFO L93 Difference]: Finished difference Result 8919 states and 11788 transitions. [2022-11-25 17:03:50,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 17:03:50,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 205 [2022-11-25 17:03:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:03:50,484 INFO L225 Difference]: With dead ends: 8919 [2022-11-25 17:03:50,484 INFO L226 Difference]: Without dead ends: 6161 [2022-11-25 17:03:50,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-11-25 17:03:50,495 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 572 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:03:50,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1291 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 17:03:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6161 states. [2022-11-25 17:03:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6161 to 2789. [2022-11-25 17:03:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2199 states have (on average 1.259663483401546) internal successors, (2770), 2219 states have internal predecessors, (2770), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 433 states have call predecessors, (477), 417 states have call successors, (477) [2022-11-25 17:03:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3665 transitions. [2022-11-25 17:03:51,485 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3665 transitions. Word has length 205 [2022-11-25 17:03:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:03:51,490 INFO L495 AbstractCegarLoop]: Abstraction has 2789 states and 3665 transitions. [2022-11-25 17:03:51,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-25 17:03:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3665 transitions. [2022-11-25 17:03:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-11-25 17:03:51,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:03:51,502 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:51,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:03:51,502 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:03:51,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1660857439, now seen corresponding path program 1 times [2022-11-25 17:03:51,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:51,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373276319] [2022-11-25 17:03:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:51,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:52,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:52,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:52,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:52,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:03:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:52,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:52,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:03:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:52,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:03:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:52,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:52,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:03:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:52,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:03:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:52,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 17:03:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 17:03:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:03:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 17:03:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 17:03:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:03:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-25 17:03:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-25 17:03:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-25 17:03:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-25 17:03:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-25 17:03:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-25 17:03:53,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:53,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373276319] [2022-11-25 17:03:53,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373276319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:03:53,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645167005] [2022-11-25 17:03:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:53,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:03:53,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:03:53,240 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:03:53,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:03:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-25 17:03:53,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:03:54,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:03:54,104 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 7 treesize of output 6 [2022-11-25 17:03:54,700 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1036 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1036))) is different from true [2022-11-25 17:03:54,775 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 17:03:54,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:03:54,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:03:54,834 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:03:54,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 17:03:56,789 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 13 treesize of output 15 [2022-11-25 17:03:57,067 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 13 treesize of output 15 [2022-11-25 17:03:57,084 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 13 treesize of output 15 [2022-11-25 17:03:57,340 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 13 treesize of output 15 [2022-11-25 17:03:57,355 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 13 treesize of output 15 [2022-11-25 17:03:57,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:03:57,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-25 17:03:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 40 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 2 not checked. [2022-11-25 17:03:57,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:03:59,492 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1047 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-25 17:03:59,507 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1047 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-25 17:03:59,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645167005] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:03:59,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:03:59,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 41 [2022-11-25 17:03:59,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196842998] [2022-11-25 17:03:59,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:03:59,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-25 17:03:59,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:59,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-25 17:03:59,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1422, Unknown=15, NotChecked=234, Total=1806 [2022-11-25 17:03:59,527 INFO L87 Difference]: Start difference. First operand 2789 states and 3665 transitions. Second operand has 41 states, 38 states have (on average 6.5) internal successors, (247), 28 states have internal predecessors, (247), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-11-25 17:04:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:04:16,673 INFO L93 Difference]: Finished difference Result 15250 states and 20682 transitions. [2022-11-25 17:04:16,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-25 17:04:16,675 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 6.5) internal successors, (247), 28 states have internal predecessors, (247), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) Word has length 212 [2022-11-25 17:04:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:04:16,749 INFO L225 Difference]: With dead ends: 15250 [2022-11-25 17:04:16,749 INFO L226 Difference]: Without dead ends: 12480 [2022-11-25 17:04:16,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 281 SyntacticMatches, 14 SemanticMatches, 102 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=951, Invalid=9130, Unknown=31, NotChecked=600, Total=10712 [2022-11-25 17:04:16,765 INFO L413 NwaCegarLoop]: 493 mSDtfsCounter, 2179 mSDsluCounter, 12010 mSDsCounter, 0 mSdLazyCounter, 7909 mSolverCounterSat, 778 mSolverCounterUnsat, 112 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 12503 SdHoareTripleChecker+Invalid, 9686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 7909 IncrementalHoareTripleChecker+Invalid, 112 IncrementalHoareTripleChecker+Unknown, 887 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:04:16,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2207 Valid, 12503 Invalid, 9686 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [778 Valid, 7909 Invalid, 112 Unknown, 887 Unchecked, 10.7s Time] [2022-11-25 17:04:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12480 states. [2022-11-25 17:04:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12480 to 6541. [2022-11-25 17:04:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6541 states, 5231 states have (on average 1.2735614605238004) internal successors, (6662), 5315 states have internal predecessors, (6662), 862 states have call successors, (862), 388 states have call predecessors, (862), 447 states have return successors, (1125), 909 states have call predecessors, (1125), 861 states have call successors, (1125) [2022-11-25 17:04:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6541 states to 6541 states and 8649 transitions. [2022-11-25 17:04:18,908 INFO L78 Accepts]: Start accepts. Automaton has 6541 states and 8649 transitions. Word has length 212 [2022-11-25 17:04:18,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:04:18,909 INFO L495 AbstractCegarLoop]: Abstraction has 6541 states and 8649 transitions. [2022-11-25 17:04:18,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 6.5) internal successors, (247), 28 states have internal predecessors, (247), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-11-25 17:04:18,909 INFO L276 IsEmpty]: Start isEmpty. Operand 6541 states and 8649 transitions. [2022-11-25 17:04:18,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-11-25 17:04:18,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:04:18,923 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:04:18,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:04:19,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:04:19,134 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:04:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:04:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1154314915, now seen corresponding path program 2 times [2022-11-25 17:04:19,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:04:19,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167234160] [2022-11-25 17:04:19,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:04:19,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:04:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:04:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:04:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:04:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:04:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:04:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:04:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:04:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:04:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:04:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:04:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 17:04:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:04:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:04:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 17:04:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:04:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-25 17:04:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 17:04:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:04:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-25 17:04:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-25 17:04:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-25 17:04:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-25 17:04:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-25 17:04:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-11-25 17:04:20,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:04:20,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167234160] [2022-11-25 17:04:20,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167234160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:04:20,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464714912] [2022-11-25 17:04:20,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:04:20,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:04:20,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:04:20,976 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:04:20,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:04:21,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:04:21,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:04:21,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 1863 conjuncts, 144 conjunts are in the unsatisfiable core [2022-11-25 17:04:21,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:04:21,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:04:21,878 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 7 treesize of output 6 [2022-11-25 17:04:22,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 17:04:22,500 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1330 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1330))) is different from true [2022-11-25 17:04:22,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 17:04:22,642 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 17:04:22,753 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:04:22,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2022-11-25 17:04:22,784 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:04:22,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:04:23,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:04:23,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:04:23,564 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:04:23,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 17:04:24,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:04:25,242 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:04:25,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 17:04:26,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:04:26,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:04:26,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:04:27,299 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 13 treesize of output 15 [2022-11-25 17:04:27,314 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 13 treesize of output 15 [2022-11-25 17:04:27,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:04:27,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-25 17:04:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 42 proven. 74 refuted. 0 times theorem prover too weak. 17 trivial. 2 not checked. [2022-11-25 17:04:27,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:04:27,505 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-25 17:04:27,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464714912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:04:27,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:04:27,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 48] total 59 [2022-11-25 17:04:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292202898] [2022-11-25 17:04:27,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:04:27,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-25 17:04:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:04:27,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-25 17:04:27,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3211, Unknown=3, NotChecked=230, Total=3660 [2022-11-25 17:04:27,534 INFO L87 Difference]: Start difference. First operand 6541 states and 8649 transitions. Second operand has 59 states, 56 states have (on average 4.678571428571429) internal successors, (262), 42 states have internal predecessors, (262), 15 states have call successors, (42), 12 states have call predecessors, (42), 16 states have return successors, (42), 21 states have call predecessors, (42), 15 states have call successors, (42) [2022-11-25 17:04:59,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:04:59,969 INFO L93 Difference]: Finished difference Result 21984 states and 29881 transitions. [2022-11-25 17:04:59,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-25 17:04:59,970 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 56 states have (on average 4.678571428571429) internal successors, (262), 42 states have internal predecessors, (262), 15 states have call successors, (42), 12 states have call predecessors, (42), 16 states have return successors, (42), 21 states have call predecessors, (42), 15 states have call successors, (42) Word has length 218 [2022-11-25 17:04:59,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:00,033 INFO L225 Difference]: With dead ends: 21984 [2022-11-25 17:05:00,033 INFO L226 Difference]: Without dead ends: 15462 [2022-11-25 17:05:00,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 273 SyntacticMatches, 15 SemanticMatches, 136 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5308 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1318, Invalid=17044, Unknown=6, NotChecked=538, Total=18906 [2022-11-25 17:05:00,057 INFO L413 NwaCegarLoop]: 645 mSDtfsCounter, 2220 mSDsluCounter, 24219 mSDsCounter, 0 mSdLazyCounter, 15399 mSolverCounterSat, 754 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2253 SdHoareTripleChecker+Valid, 24864 SdHoareTripleChecker+Invalid, 17483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 15399 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1325 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:00,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2253 Valid, 24864 Invalid, 17483 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [754 Valid, 15399 Invalid, 5 Unknown, 1325 Unchecked, 22.6s Time] [2022-11-25 17:05:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15462 states. [2022-11-25 17:05:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15462 to 7099. [2022-11-25 17:05:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7099 states, 5692 states have (on average 1.2749472944483486) internal successors, (7257), 5784 states have internal predecessors, (7257), 931 states have call successors, (931), 414 states have call predecessors, (931), 475 states have return successors, (1218), 980 states have call predecessors, (1218), 930 states have call successors, (1218) [2022-11-25 17:05:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7099 states to 7099 states and 9406 transitions. [2022-11-25 17:05:02,129 INFO L78 Accepts]: Start accepts. Automaton has 7099 states and 9406 transitions. Word has length 218 [2022-11-25 17:05:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:02,129 INFO L495 AbstractCegarLoop]: Abstraction has 7099 states and 9406 transitions. [2022-11-25 17:05:02,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 56 states have (on average 4.678571428571429) internal successors, (262), 42 states have internal predecessors, (262), 15 states have call successors, (42), 12 states have call predecessors, (42), 16 states have return successors, (42), 21 states have call predecessors, (42), 15 states have call successors, (42) [2022-11-25 17:05:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 7099 states and 9406 transitions. [2022-11-25 17:05:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-11-25 17:05:02,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:02,153 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:05:02,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:02,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 17:05:02,370 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:02,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:02,371 INFO L85 PathProgramCache]: Analyzing trace with hash -789994785, now seen corresponding path program 3 times [2022-11-25 17:05:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:02,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96628737] [2022-11-25 17:05:02,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:05:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:05:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:05:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:05:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:05:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:05:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:05:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:05:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 17:05:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:05:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 17:05:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:05:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:03,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:04,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-25 17:05:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:04,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-25 17:05:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:04,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:04,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-25 17:05:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-11-25 17:05:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:04,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-25 17:05:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:04,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:05:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:04,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:05:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-11-25 17:05:04,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:04,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96628737] [2022-11-25 17:05:04,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96628737] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:04,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744054723] [2022-11-25 17:05:04,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:05:04,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:04,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:04,100 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:04,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:05:04,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 17:05:04,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:05:04,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 17:05:04,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-11-25 17:05:04,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:05:04,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744054723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:05:04,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:05:04,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2022-11-25 17:05:04,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854688910] [2022-11-25 17:05:04,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:05:04,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:05:04,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:04,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:05:05,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:05:05,000 INFO L87 Difference]: Start difference. First operand 7099 states and 9406 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-25 17:05:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:06,818 INFO L93 Difference]: Finished difference Result 13645 states and 18060 transitions. [2022-11-25 17:05:06,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:05:06,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 224 [2022-11-25 17:05:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:06,849 INFO L225 Difference]: With dead ends: 13645 [2022-11-25 17:05:06,850 INFO L226 Difference]: Without dead ends: 7099 [2022-11-25 17:05:06,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:05:06,871 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 0 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:06,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1125 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:05:06,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7099 states. [2022-11-25 17:05:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7099 to 7099. [2022-11-25 17:05:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7099 states, 5692 states have (on average 1.2749472944483486) internal successors, (7257), 5784 states have internal predecessors, (7257), 931 states have call successors, (931), 414 states have call predecessors, (931), 475 states have return successors, (1206), 980 states have call predecessors, (1206), 930 states have call successors, (1206) [2022-11-25 17:05:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7099 states to 7099 states and 9394 transitions. [2022-11-25 17:05:08,585 INFO L78 Accepts]: Start accepts. Automaton has 7099 states and 9394 transitions. Word has length 224 [2022-11-25 17:05:08,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:08,588 INFO L495 AbstractCegarLoop]: Abstraction has 7099 states and 9394 transitions. [2022-11-25 17:05:08,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-25 17:05:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 7099 states and 9394 transitions. [2022-11-25 17:05:08,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2022-11-25 17:05:08,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:08,609 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:05:08,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:08,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 17:05:08,820 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:08,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:08,820 INFO L85 PathProgramCache]: Analyzing trace with hash 962005083, now seen corresponding path program 4 times [2022-11-25 17:05:08,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:08,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782723231] [2022-11-25 17:05:08,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:08,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:05:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:05:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:05:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:05:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:05:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:05:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:05:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:05:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 17:05:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:05:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 17:05:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:05:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-25 17:05:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-25 17:05:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-25 17:05:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-11-25 17:05:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-25 17:05:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-25 17:05:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-25 17:05:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-11-25 17:05:10,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:10,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782723231] [2022-11-25 17:05:10,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782723231] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:10,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674550554] [2022-11-25 17:05:10,551 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:05:10,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:10,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:10,553 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:10,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:05:11,357 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:05:11,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:05:11,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-25 17:05:11,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:11,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:05:11,418 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 7 treesize of output 6 [2022-11-25 17:05:11,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 17:05:11,907 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1926 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1926))) is different from true [2022-11-25 17:05:11,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 17:05:11,986 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 17:05:12,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:12,039 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 13 treesize of output 15 [2022-11-25 17:05:12,066 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:05:12,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:05:12,189 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 5 treesize of output 3 [2022-11-25 17:05:12,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 17:05:12,401 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:05:12,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:05:12,763 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 5 treesize of output 3 [2022-11-25 17:05:12,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 17:05:13,315 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:05:13,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:05:13,459 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 5 treesize of output 3 [2022-11-25 17:05:13,999 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:05:14,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 17:05:14,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:05:14,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:05:14,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:05:14,763 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 13 treesize of output 15 [2022-11-25 17:05:14,772 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 13 treesize of output 15 [2022-11-25 17:05:14,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:14,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-25 17:05:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 80 proven. 52 refuted. 19 times theorem prover too weak. 40 trivial. 2 not checked. [2022-11-25 17:05:14,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:05:14,885 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1938 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1938) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-25 17:05:14,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674550554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:14,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:05:14,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 40] total 47 [2022-11-25 17:05:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917865724] [2022-11-25 17:05:14,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:05:14,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-25 17:05:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:14,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-25 17:05:14,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1876, Unknown=33, NotChecked=178, Total=2256 [2022-11-25 17:05:14,912 INFO L87 Difference]: Start difference. First operand 7099 states and 9394 transitions. Second operand has 47 states, 44 states have (on average 5.863636363636363) internal successors, (258), 34 states have internal predecessors, (258), 16 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (43), 19 states have call predecessors, (43), 16 states have call successors, (43) [2022-11-25 17:05:39,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:39,146 INFO L93 Difference]: Finished difference Result 22426 states and 30516 transitions. [2022-11-25 17:05:39,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-11-25 17:05:39,147 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 5.863636363636363) internal successors, (258), 34 states have internal predecessors, (258), 16 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (43), 19 states have call predecessors, (43), 16 states have call successors, (43) Word has length 230 [2022-11-25 17:05:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:39,209 INFO L225 Difference]: With dead ends: 22426 [2022-11-25 17:05:39,210 INFO L226 Difference]: Without dead ends: 15514 [2022-11-25 17:05:39,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 309 SyntacticMatches, 14 SemanticMatches, 104 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3332 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=874, Invalid=9784, Unknown=62, NotChecked=410, Total=11130 [2022-11-25 17:05:39,235 INFO L413 NwaCegarLoop]: 655 mSDtfsCounter, 1920 mSDsluCounter, 15729 mSDsCounter, 0 mSdLazyCounter, 11286 mSolverCounterSat, 834 mSolverCounterUnsat, 161 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 16384 SdHoareTripleChecker+Invalid, 13125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 834 IncrementalHoareTripleChecker+Valid, 11286 IncrementalHoareTripleChecker+Invalid, 161 IncrementalHoareTripleChecker+Unknown, 844 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:39,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 16384 Invalid, 13125 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [834 Valid, 11286 Invalid, 161 Unknown, 844 Unchecked, 16.9s Time] [2022-11-25 17:05:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15514 states. [2022-11-25 17:05:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15514 to 6993. [2022-11-25 17:05:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6993 states, 5600 states have (on average 1.27125) internal successors, (7119), 5676 states have internal predecessors, (7119), 921 states have call successors, (921), 410 states have call predecessors, (921), 471 states have return successors, (1182), 982 states have call predecessors, (1182), 920 states have call successors, (1182) [2022-11-25 17:05:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6993 states to 6993 states and 9222 transitions. [2022-11-25 17:05:41,379 INFO L78 Accepts]: Start accepts. Automaton has 6993 states and 9222 transitions. Word has length 230 [2022-11-25 17:05:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:41,380 INFO L495 AbstractCegarLoop]: Abstraction has 6993 states and 9222 transitions. [2022-11-25 17:05:41,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 5.863636363636363) internal successors, (258), 34 states have internal predecessors, (258), 16 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (43), 19 states have call predecessors, (43), 16 states have call successors, (43) [2022-11-25 17:05:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 6993 states and 9222 transitions. [2022-11-25 17:05:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-11-25 17:05:41,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:41,396 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:05:41,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:41,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:41,608 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:41,608 INFO L85 PathProgramCache]: Analyzing trace with hash -835442034, now seen corresponding path program 1 times [2022-11-25 17:05:41,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:41,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035118354] [2022-11-25 17:05:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:48,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:05:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:48,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:05:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:48,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:05:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:48,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:05:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:48,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:05:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:05:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:49,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:05:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:49,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:05:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:49,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 17:05:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:49,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:05:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 17:05:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:05:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-25 17:05:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-25 17:05:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-25 17:05:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-25 17:05:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:05:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-25 17:05:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-25 17:05:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-25 17:05:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 11 proven. 69 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-25 17:05:50,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:50,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035118354] [2022-11-25 17:05:50,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035118354] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:50,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162191701] [2022-11-25 17:05:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:50,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:50,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:50,840 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:50,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:05:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:51,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 1956 conjuncts, 151 conjunts are in the unsatisfiable core [2022-11-25 17:05:51,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:51,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:05:51,860 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 7 treesize of output 6 [2022-11-25 17:05:52,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-25 17:05:52,554 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2254 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2254) |c_#memory_int|)) is different from true [2022-11-25 17:05:52,750 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 17:05:52,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-25 17:05:52,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:52,804 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 13 treesize of output 15 [2022-11-25 17:05:52,827 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-25 17:05:52,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-11-25 17:05:52,979 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 5 treesize of output 3 [2022-11-25 17:05:53,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 17:05:53,586 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:05:53,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:05:55,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:05:55,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 17:05:56,060 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 17:05:56,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-25 17:05:56,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-25 17:05:57,469 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-25 17:05:57,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-25 17:05:58,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:05:58,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:05:58,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:05:58,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:05:59,308 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 13 treesize of output 15 [2022-11-25 17:05:59,408 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 13 treesize of output 15 [2022-11-25 17:05:59,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:59,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-25 17:05:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 86 proven. 106 refuted. 0 times theorem prover too weak. 38 trivial. 2 not checked. [2022-11-25 17:05:59,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:05:59,470 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_2268 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)))) is different from false [2022-11-25 17:06:01,487 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)))) is different from false [2022-11-25 17:06:01,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162191701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:06:01,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:01,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48] total 86 [2022-11-25 17:06:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762268300] [2022-11-25 17:06:01,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:01,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-11-25 17:06:01,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:01,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-11-25 17:06:01,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=6727, Unknown=17, NotChecked=504, Total=7656 [2022-11-25 17:06:01,508 INFO L87 Difference]: Start difference. First operand 6993 states and 9222 transitions. Second operand has 86 states, 81 states have (on average 3.3703703703703702) internal successors, (273), 68 states have internal predecessors, (273), 27 states have call successors, (46), 13 states have call predecessors, (46), 22 states have return successors, (47), 32 states have call predecessors, (47), 27 states have call successors, (47) [2022-11-25 17:06:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:36,045 INFO L93 Difference]: Finished difference Result 19646 states and 26170 transitions. [2022-11-25 17:06:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-25 17:06:36,045 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 81 states have (on average 3.3703703703703702) internal successors, (273), 68 states have internal predecessors, (273), 27 states have call successors, (46), 13 states have call predecessors, (46), 22 states have return successors, (47), 32 states have call predecessors, (47), 27 states have call successors, (47) Word has length 237 [2022-11-25 17:06:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:36,089 INFO L225 Difference]: With dead ends: 19646 [2022-11-25 17:06:36,090 INFO L226 Difference]: Without dead ends: 13080 [2022-11-25 17:06:36,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 300 SyntacticMatches, 17 SemanticMatches, 167 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 9271 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=2093, Invalid=25271, Unknown=38, NotChecked=990, Total=28392 [2022-11-25 17:06:36,114 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 3233 mSDsluCounter, 18276 mSDsCounter, 0 mSdLazyCounter, 17279 mSolverCounterSat, 1418 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3263 SdHoareTripleChecker+Valid, 18776 SdHoareTripleChecker+Invalid, 19827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1418 IncrementalHoareTripleChecker+Valid, 17279 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 1094 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:36,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3263 Valid, 18776 Invalid, 19827 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1418 Valid, 17279 Invalid, 36 Unknown, 1094 Unchecked, 20.9s Time] [2022-11-25 17:06:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13080 states. [2022-11-25 17:06:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13080 to 8483. [2022-11-25 17:06:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8483 states, 6908 states have (on average 1.2802547770700636) internal successors, (8844), 6986 states have internal predecessors, (8844), 1021 states have call successors, (1021), 492 states have call predecessors, (1021), 553 states have return successors, (1294), 1080 states have call predecessors, (1294), 1020 states have call successors, (1294) [2022-11-25 17:06:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8483 states to 8483 states and 11159 transitions. [2022-11-25 17:06:38,370 INFO L78 Accepts]: Start accepts. Automaton has 8483 states and 11159 transitions. Word has length 237 [2022-11-25 17:06:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:38,370 INFO L495 AbstractCegarLoop]: Abstraction has 8483 states and 11159 transitions. [2022-11-25 17:06:38,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 81 states have (on average 3.3703703703703702) internal successors, (273), 68 states have internal predecessors, (273), 27 states have call successors, (46), 13 states have call predecessors, (46), 22 states have return successors, (47), 32 states have call predecessors, (47), 27 states have call successors, (47) [2022-11-25 17:06:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 8483 states and 11159 transitions. [2022-11-25 17:06:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-11-25 17:06:38,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:38,386 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:06:38,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:06:38,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:38,597 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:06:38,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:38,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1440317130, now seen corresponding path program 1 times [2022-11-25 17:06:38,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:38,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883597655] [2022-11-25 17:06:38,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:38,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:06:39,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:06:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:06:41,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:06:41,018 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:06:41,020 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 17:06:41,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 17:06:41,028 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:41,034 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:06:41,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:06:41 BoogieIcfgContainer [2022-11-25 17:06:41,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:06:41,497 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:06:41,497 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:06:41,498 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:06:41,498 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:03:20" (3/4) ... [2022-11-25 17:06:41,502 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:06:41,502 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:06:41,503 INFO L158 Benchmark]: Toolchain (without parser) took 205211.06ms. Allocated memory was 153.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 103.3MB in the beginning and 748.8MB in the end (delta: -645.5MB). Peak memory consumption was 863.6MB. Max. memory is 16.1GB. [2022-11-25 17:06:41,504 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 115.3MB. Free memory was 90.5MB in the beginning and 90.4MB in the end (delta: 78.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:06:41,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1783.93ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 82.9MB in the end (delta: 20.4MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2022-11-25 17:06:41,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 154.90ms. Allocated memory is still 153.1MB. Free memory was 82.9MB in the beginning and 76.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 17:06:41,505 INFO L158 Benchmark]: Boogie Preprocessor took 149.45ms. Allocated memory is still 153.1MB. Free memory was 76.7MB in the beginning and 70.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 17:06:41,506 INFO L158 Benchmark]: RCFGBuilder took 1624.40ms. Allocated memory is still 153.1MB. Free memory was 70.4MB in the beginning and 53.9MB in the end (delta: 16.5MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2022-11-25 17:06:41,507 INFO L158 Benchmark]: TraceAbstraction took 201450.80ms. Allocated memory was 205.5MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 156.5MB in the beginning and 748.8MB in the end (delta: -592.3MB). Peak memory consumption was 862.1MB. Max. memory is 16.1GB. [2022-11-25 17:06:41,507 INFO L158 Benchmark]: Witness Printer took 5.41ms. Allocated memory is still 1.7GB. Free memory is still 748.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:06:41,509 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.37ms. Allocated memory is still 115.3MB. Free memory was 90.5MB in the beginning and 90.4MB in the end (delta: 78.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1783.93ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 82.9MB in the end (delta: 20.4MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 154.90ms. Allocated memory is still 153.1MB. Free memory was 82.9MB in the beginning and 76.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 149.45ms. Allocated memory is still 153.1MB. Free memory was 76.7MB in the beginning and 70.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1624.40ms. Allocated memory is still 153.1MB. Free memory was 70.4MB in the beginning and 53.9MB in the end (delta: 16.5MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 201450.80ms. Allocated memory was 205.5MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 156.5MB in the beginning and 748.8MB in the end (delta: -592.3MB). Peak memory consumption was 862.1MB. Max. memory is 16.1GB. * Witness Printer took 5.41ms. Allocated memory is still 1.7GB. Free memory is still 748.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 4063]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 3839, overapproximation of strlen at line 3778, overapproximation of bitwiseOr at line 3801, overapproximation of bitwiseAnd at line 3406, overapproximation of snprintf at line 3350. Possible FailurePath: [L3543] int LDV_IN_INTERRUPT = 1; [L3544] int ref_cnt ; [L3545] int ldv_state_variable_1 ; [L3546] int usb_counter ; [L3547] struct usb_interface *usb_acecad_driver_group1 ; [L3548] int ldv_state_variable_0 ; [L3832-L3836] static struct usb_device_id usb_acecad_id_table[3U] = { {3U, 1120U, 4U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1120U, 8U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 1UL}}; [L3837] struct usb_device_id const __mod_usb_device_table ; [L3838-L3843] static struct usb_driver usb_acecad_driver = {"usb_acecad", & usb_acecad_probe, & usb_acecad_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& usb_acecad_id_table), {{{{{0U}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, (unsigned char)0}; [L3865] int ldv_retval_0 ; [L3866] int ldv_retval_1 ; [L4066] int URB_STATE = 0; [L4067] int DEV_STATE = 0; [L4068] int INTERF_STATE = 0; [L4069] int SERIAL_STATE = 0; [L4070] void *usb_intfdata = (void *)0; [L4071] struct urb *int_urb = (struct urb *)0; [L4072] struct urb *bulk_urb = (struct urb *)0; [L4073] void (*completeFnInt)(struct urb * ) ; [L4074] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3880] struct usb_device_id *ldvarg0 ; [L3881] void *tmp ; [L3882] int tmp___0 ; [L3883] int tmp___1 ; [L3884] int tmp___2 ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] CALL, EXPR ldv_init_zalloc(24UL) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, size=24, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] p = tmp VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] return (p); VAL [={0:0}, ={0:0}, \old(size)=24, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] RET, EXPR ldv_init_zalloc(24UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(24UL)={-18446744073709551617:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] tmp = ldv_init_zalloc(24UL) [L3887] ldvarg0 = (struct usb_device_id *)tmp [L3888] FCALL ldv_initialize() [L3889] ldv_state_variable_1 = 0 [L3890] ref_cnt = 0 [L3891] ldv_state_variable_0 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: [L3925] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3926] COND TRUE ldv_state_variable_0 != 0 [L3927] tmp___2 = __VERIFIER_nondet_int() [L3929] case 0: [L3937] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3938] COND TRUE ldv_state_variable_0 == 1 [L3939] CALL, EXPR usb_acecad_init() [L3846] int result ; [L3847] int tmp ; [L3849] CALL, EXPR usb_register(& usb_acecad_driver) [L3359] int tmp ; [L3361] CALL, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3980] ldv_func_ret_type ldv_func_res ; [L3981] int tmp ; [L3983] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4343] return __VERIFIER_nondet_int(); [L3983] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3983] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3984] ldv_func_res = tmp [L3985] ldv_state_variable_1 = 1 [L3986] usb_counter = 0 [L3987] CALL ldv_usb_driver_1() [L3871] void *tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] CALL, EXPR ldv_init_zalloc(1248UL) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, calloc(1UL, size)={-110680464442257309697:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1248, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, calloc(1UL, size)={-110680464442257309697:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-110680464442257309697:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-110680464442257309697:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, calloc(1UL, size)={-110680464442257309697:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-110680464442257309697:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-110680464442257309697:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] return (p); VAL [={0:0}, ={0:0}, \old(size)=1248, \result={-110680464442257309697:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, calloc(1UL, size)={-110680464442257309697:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-110680464442257309697:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-110680464442257309697:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] RET, EXPR ldv_init_zalloc(1248UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1248UL)={-110680464442257309697:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] tmp = ldv_init_zalloc(1248UL) [L3874] usb_acecad_driver_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-110680464442257309697:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3987] RET ldv_usb_driver_1() [L3988] return (ldv_func_res); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, ldv_func_arg2={18446744073709551618:18446744073709551644}, ldv_func_arg2={18446744073709551618:18446744073709551644}, ldv_func_arg3={3:0}, ldv_func_arg3={3:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3361] RET, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3361] tmp = ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3362] return (tmp); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, driver={12:0}, driver={12:0}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3849] RET, EXPR usb_register(& usb_acecad_driver) [L3849] tmp = usb_register(& usb_acecad_driver) [L3850] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3851] COND TRUE result == 0 [L3855] return (result); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3939] RET, EXPR usb_acecad_init() [L3939] ldv_retval_1 = usb_acecad_init() [L3940] COND TRUE ldv_retval_1 == 0 [L3941] ldv_state_variable_0 = 3 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3944] COND FALSE !(ldv_retval_1 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3896] COND TRUE ldv_state_variable_1 != 0 [L3897] tmp___1 = __VERIFIER_nondet_int() [L3899] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___1=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3900] COND TRUE ldv_state_variable_1 == 1 [L3901] CALL, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3693] struct usb_device *dev ; [L3694] struct usb_device *tmp ; [L3695] struct usb_host_interface *interface ; [L3696] struct usb_endpoint_descriptor *endpoint ; [L3697] struct usb_acecad *acecad ; [L3698] struct input_dev *input_dev ; [L3699] int pipe ; [L3700] int maxp ; [L3701] int err ; [L3702] int tmp___0 ; [L3703] unsigned int tmp___1 ; [L3704] __u16 tmp___2 ; [L3705] void *tmp___3 ; [L3706] void *tmp___4 ; [L3707] size_t tmp___5 ; [L3708] size_t tmp___6 ; [L3710] CALL, EXPR interface_to_usbdev(intf) [L3971] struct usb_device *tmp ; [L3973] CALL, EXPR ldv_interface_to_usbdev() [L4189] void *result ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] CALL, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103233:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103233:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=1822, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103233:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] RET, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-36893488147419103233:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] result = ldv_malloc(sizeof(struct usb_device)) [L4195] COND FALSE !((unsigned long )result == (unsigned long )((void *)0)) [L4199] return ((struct usb_device *)result); VAL [={0:0}, ={0:0}, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-36893488147419103233:0}, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3973] RET, EXPR ldv_interface_to_usbdev() [L3973] tmp = ldv_interface_to_usbdev() [L3974] return (tmp); VAL [={0:0}, ={0:0}, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3710] RET, EXPR interface_to_usbdev(intf) [L3710] tmp = interface_to_usbdev(intf) [L3711] dev = tmp [L3712] EXPR intf->cur_altsetting [L3712] interface = intf->cur_altsetting [L3713] EXPR interface->desc.bNumEndpoints VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, id={-18446744073709551617:0}, id={-18446744073709551617:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, interface->desc.bNumEndpoints=-255, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3713] COND FALSE !((unsigned int )interface->desc.bNumEndpoints != 1U) [L3717] EXPR interface->endpoint [L3717] endpoint = & (interface->endpoint)->desc [L3718] CALL, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3314] int tmp ; [L3315] int tmp___0 ; [L3316] int tmp___1 ; [L3318] CALL, EXPR usb_endpoint_xfer_int(epd) [L3309] EXPR epd->bmAttributes [L3309] return (((int )epd->bmAttributes & 3) == 3); [L3318] RET, EXPR usb_endpoint_xfer_int(epd) [L3318] tmp = usb_endpoint_xfer_int(epd) [L3319] COND TRUE tmp != 0 [L3320] CALL, EXPR usb_endpoint_dir_in(epd) [L3303] EXPR epd->bEndpointAddress [L3303] return ((int )((signed char )epd->bEndpointAddress) < 0); [L3320] RET, EXPR usb_endpoint_dir_in(epd) [L3320] tmp___0 = usb_endpoint_dir_in(epd) [L3321] COND TRUE tmp___0 != 0 [L3322] tmp___1 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epd={18446744073709551621:19}, epd={18446744073709551621:19}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3329] return (tmp___1); VAL [={0:0}, ={0:0}, \result=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epd={18446744073709551621:19}, epd={18446744073709551621:19}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3718] RET, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3718] tmp___0 = usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3719] COND FALSE !(tmp___0 == 0) [L3723] EXPR endpoint->bEndpointAddress [L3723] CALL, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3383] EXPR dev->devnum [L3383] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L3723] RET, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3723] tmp___1 = __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3724] pipe = (int )(tmp___1 | 1073741952U) [L3725] CALL, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3388] struct usb_host_endpoint *ep ; [L3389] unsigned int epnum ; [L3390] int __ret_warn_on ; [L3391] long tmp ; [L3392] int __ret_warn_on___0 ; [L3393] long tmp___0 ; VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3395] epnum = (unsigned int )(pipe >> 15) & 15U VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3396] COND FALSE !(is_out != 0) [L3406] __ret_warn_on___0 = (pipe & 128) == 0 VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3407] CALL, EXPR ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3540] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, c=0, DEV_STATE=0, exp=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3407] RET, EXPR ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, ldv__builtin_expect(__ret_warn_on___0 != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3407] tmp___0 = ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) [L3408] COND FALSE !(tmp___0 != 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3412] CALL ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3540] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, c=0, DEV_STATE=0, exp=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3412] RET ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, ldv__builtin_expect(__ret_warn_on___0 != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3413] EXPR udev->ep_in[epnum] [L3413] ep = udev->ep_in[epnum] [L3415] COND TRUE (unsigned long )ep == (unsigned long )((struct usb_host_endpoint *)0) [L3416] return (0U); VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, ep={18446744073709551599:17}, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3725] RET, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3725] tmp___2 = usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3726] maxp = (int )tmp___2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] CALL, EXPR kzalloc(232UL, 208U) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3447] void *tmp ; [L3449] CALL, EXPR kmalloc(size, flags | 32768U) [L3438] void *tmp___1 ; [L3440] CALL, EXPR __kmalloc(size, flags) [L3433] CALL, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654849:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654849:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=232, \result={-55340232221128654849:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654849:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] RET, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=232, \old(t)=32768, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-55340232221128654849:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, t=32768, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] return ldv_malloc(size); [L3440] RET, EXPR __kmalloc(size, flags) [L3440] tmp___1 = __kmalloc(size, flags) [L3441] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=232, \result={-55340232221128654849:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, flags=32768, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, tmp___1={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3449] RET, EXPR kmalloc(size, flags | 32768U) [L3449] tmp = kmalloc(size, flags | 32768U) [L3450] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=232, \result={-55340232221128654849:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, flags=208, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] RET, EXPR kzalloc(232UL, 208U) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, kzalloc(232UL, 208U)={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] tmp___3 = kzalloc(232UL, 208U) [L3728] acecad = (struct usb_acecad *)tmp___3 [L3729] CALL, EXPR input_allocate_device() [L3551] CALL, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3447] void *tmp ; [L3449] CALL, EXPR kmalloc(size, flags | 32768U) [L3438] void *tmp___1 ; [L3440] CALL, EXPR __kmalloc(size, flags) [L3433] CALL, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=1855, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] RET, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=1855, \old(t)=32768, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, t=32768, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] return ldv_malloc(size); [L3440] RET, EXPR __kmalloc(size, flags) [L3440] tmp___1 = __kmalloc(size, flags) [L3441] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=1855, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, flags=32768, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp___1={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3449] RET, EXPR kmalloc(size, flags | 32768U) [L3449] tmp = kmalloc(size, flags | 32768U) [L3450] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=128, \old(size)=1855, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, flags=128, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3551] RET, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u)={-36893488147419103231:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3551] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L3729] RET, EXPR input_allocate_device() [L3729] input_dev = input_allocate_device() [L3730] COND FALSE !((unsigned long )acecad == (unsigned long )((struct usb_acecad *)0) || (unsigned long )input_dev == (unsigned long )((struct input_dev *)0)) [L3735] CALL, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L4324] CALL, EXPR ldv_malloc(0UL) VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-73786976294838206465:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-73786976294838206465:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=0, \result={-73786976294838206465:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-73786976294838206465:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4324] RET, EXPR ldv_malloc(0UL) VAL [={0:0}, ={0:0}, \old(arg1)=8, \old(arg2)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, arg0={-36893488147419103233:0}, arg0={-36893488147419103233:0}, arg1=8, arg2=208, arg3={-55340232221128654849:224}, arg3={-55340232221128654849:224}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-73786976294838206465:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4324] return ldv_malloc(0UL); [L3735] RET, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3735] tmp___4 = usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3736] acecad->data = (unsigned char *)tmp___4 [L3737] EXPR acecad->data VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, acecad->data={-73786976294838206465:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3737] COND FALSE !((unsigned long )acecad->data == (unsigned long )((unsigned char *)0U)) [L3742] CALL, EXPR ldv_usb_alloc_urb_5(0, 208U) [L4009] ldv_func_ret_type___0 ldv_func_res ; [L4010] struct urb *tmp ; [L4012] CALL, EXPR usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4327] CALL, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4327] RET, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(arg0)=0, \old(arg1)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, arg0=0, arg1=208, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4327] return ldv_malloc(sizeof(struct urb)); [L4012] RET, EXPR usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4012] tmp = usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4013] ldv_func_res = tmp [L4014] CALL ldv_alloc_urb(ldv_func_res) [L4098] COND TRUE (unsigned long )res != (unsigned long )((struct urb *)0) [L4099] URB_STATE = URB_STATE + 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, res={-18446744073709551615:0}, res={-18446744073709551615:0}, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4014] RET ldv_alloc_urb(ldv_func_res) [L4015] return (ldv_func_res); VAL [={0:0}, ={0:0}, \old(ldv_func_arg1)=0, \old(ldv_func_arg2)=208, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, ldv_func_arg1=0, ldv_func_arg2=208, ldv_func_res={-18446744073709551615:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551615:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3742] RET, EXPR ldv_usb_alloc_urb_5(0, 208U) [L3742] acecad->irq = ldv_usb_alloc_urb_5(0, 208U) [L3743] EXPR acecad->irq VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, acecad->irq={-18446744073709551615:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3743] COND FALSE !((unsigned long )acecad->irq == (unsigned long )((struct urb *)0)) [L3748] acecad->usbdev = dev [L3749] acecad->input = input_dev [L3750] EXPR dev->manufacturer VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, dev->manufacturer={18446744073709551598:18}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3750] COND FALSE !((unsigned long )dev->manufacturer != (unsigned long )((char *)0)) [L3754] EXPR dev->product VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, dev->product={18446744073709551593:23}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3754] COND FALSE !((unsigned long )dev->product != (unsigned long )((char *)0)) [L3762] CALL usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3348] int actual ; [L3350] EXPR dev->bus [L3350] EXPR (dev->bus)->bus_name [L3350] actual = snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [L3351] return ((int )size > actual ? actual : -1); VAL [={0:0}, ={0:0}, \old(size)=64, \result=-1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, actual=-1, buf={-55340232221128654849:128}, buf={-55340232221128654849:128}, bulk_urb={0:0}, dev={-36893488147419103233:0}, dev={-36893488147419103233:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=64, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3762] RET usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3763] CALL strlcat((char *)(& acecad->phys), "/input0", 64UL) VAL [={0:0}, ={0:0}, \old(arg2)=64, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, arg0={-55340232221128654849:128}, arg1={8:0}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4317] return __VERIFIER_nondet_ulong(); [L3763] RET strlcat((char *)(& acecad->phys), "/input0", 64UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, strlcat((char *)(& acecad->phys), "/input0", 64UL)=18446744073709551643, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3764] input_dev->name = (char const *)(& acecad->name) [L3765] input_dev->phys = (char const *)(& acecad->phys) [L3766] CALL usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3600] id->bustype = 3U [L3601] EXPR dev->descriptor.idVendor [L3601] id->vendor = dev->descriptor.idVendor [L3602] EXPR dev->descriptor.idProduct [L3602] id->product = dev->descriptor.idProduct [L3603] EXPR dev->descriptor.bcdDevice [L3603] id->version = dev->descriptor.bcdDevice [L3766] RET usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3767] input_dev->dev.parent = & intf->dev [L3768] CALL input_set_drvdata(input_dev, (void *)acecad) [L3565] FCALL dev_set_drvdata(& dev->dev, data) [L3768] RET input_set_drvdata(input_dev, (void *)acecad) [L3769] input_dev->open = & usb_acecad_open [L3770] input_dev->close = & usb_acecad_close [L3771] input_dev->evbit[0] = 10UL [L3772] input_dev->keybit[5] = 7169UL [L3773] id->driver_info [L3774] case 0UL: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3775] FCALL input_set_abs_params(input_dev, 0U, 0, 5000, 4, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3776] FCALL input_set_abs_params(input_dev, 1U, 0, 3750, 4, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3777] FCALL input_set_abs_params(input_dev, 24U, 0, 512, 0, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3778] tmp___5 = strlen((char const *)(& acecad->name)) [L3779] COND FALSE !(tmp___5 == 0UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3798] EXPR acecad->irq [L3798] EXPR acecad->data [L3799] EXPR endpoint->bInterval [L3798-L3799] CALL ldv_usb_fill_int_urb_6(acecad->irq, dev, (unsigned int )pipe, (void *)acecad->data, 8 < maxp ? 8 : maxp, & usb_acecad_irq, (void *)acecad, (int )endpoint->bInterval) [L4024] CALL ldv_fill_int_urb(complete_fn) [L4120] struct urb *value ; [L4121] int tmp___0 ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] CALL, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-92233720368547758081:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-92233720368547758081:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \result={-92233720368547758081:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-92233720368547758081:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] RET, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-92233720368547758081:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] value = ldv_malloc(sizeof(struct urb)) [L4124] COND FALSE !((unsigned long )value == (unsigned long )((struct urb *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}, value={-92233720368547758081:0}] [L4128] CALL, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3516] int tmp ; [L3518] tmp = __VERIFIER_nondet_int() [L3519] return (tmp); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4128] RET, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_undef_int()=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}, value={-92233720368547758081:0}] [L4128] tmp___0 = ldv_undef_int() [L4129] COND FALSE !(tmp___0 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}, value={-92233720368547758081:0}] [L4024] RET ldv_fill_int_urb(complete_fn) [L3798-L3799] RET ldv_usb_fill_int_urb_6(acecad->irq, dev, (unsigned int )pipe, (void *)acecad->data, 8 < maxp ? 8 : maxp, & usb_acecad_irq, (void *)acecad, (int )endpoint->bInterval) [L3800] EXPR acecad->irq [L3800] EXPR acecad->data_dma [L3800] (acecad->irq)->transfer_dma = acecad->data_dma [L3801] EXPR acecad->irq [L3801] EXPR acecad->irq [L3801] EXPR (acecad->irq)->transfer_flags [L3801] (acecad->irq)->transfer_flags = (acecad->irq)->transfer_flags | 4U [L3802] EXPR acecad->input [L3802] CALL, EXPR input_register_device(acecad->input) [L4300] return __VERIFIER_nondet_int(); [L3802] RET, EXPR input_register_device(acecad->input) [L3802] err = input_register_device(acecad->input) [L3803] COND TRUE err != 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3810] EXPR acecad->data [L3810] EXPR acecad->data_dma VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, acecad->data={-73786976294838206465:0}, acecad->data_dma=18446744073709551632, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3810] FCALL usb_free_coherent(dev, 8UL, (void *)acecad->data, acecad->data_dma) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, acecad->data={-73786976294838206465:0}, acecad->data_dma=18446744073709551632, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3812] FCALL input_free_device(input_dev) [L3813] CALL kfree((void const *)acecad) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3813] RET kfree((void const *)acecad) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3814] return (err); VAL [={0:0}, ={0:0}, \result=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3901] RET, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3901] ldv_retval_0 = usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3902] COND FALSE !(ldv_retval_0 == 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___1=0, tmp___2=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: [L3925] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3926] COND TRUE ldv_state_variable_0 != 0 [L3927] tmp___2 = __VERIFIER_nondet_int() [L3929] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3930] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L3931] CALL usb_acecad_exit() [L3861] CALL ldv_usb_deregister_11(& usb_acecad_driver) [L4054] FCALL usb_deregister(arg) [L4055] ldv_state_variable_1 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, arg={12:0}, arg={12:0}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3861] RET ldv_usb_deregister_11(& usb_acecad_driver) [L3931] RET usb_acecad_exit() [L3932] ldv_state_variable_0 = 2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3965] CALL ldv_check_final_state() [L4267] COND TRUE URB_STATE != 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4268] CALL ldv_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4063] reach_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 236 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 200.9s, OverallIterations: 21, TraceHistogramMax: 8, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.2s, AutomataDifference: 124.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 314 mSolverCounterUnknown, 15793 SdHoareTripleChecker+Valid, 78.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15371 mSDsluCounter, 91473 SdHoareTripleChecker+Invalid, 71.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4150 IncrementalHoareTripleChecker+Unchecked, 83580 mSDsCounter, 5246 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55102 IncrementalHoareTripleChecker+Invalid, 64812 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5246 mSolverCounterUnsat, 7893 mSDtfsCounter, 55102 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3391 GetRequests, 2668 SyntacticMatches, 65 SemanticMatches, 658 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 21160 ImplicationChecksByTransitivity, 44.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8483occurred in iteration=20, InterpolantAutomatonStates: 446, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 35251 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 49.1s InterpolantComputationTime, 5123 NumberOfCodeBlocks, 4898 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 4845 ConstructedInterpolants, 314 QuantifiedInterpolants, 18497 SizeOfPredicates, 178 NumberOfNonLiveVariables, 15322 ConjunctsInSsa, 625 ConjunctsInUnsatCore, 30 InterpolantComputations, 16 PerfectInterpolantSequences, 2442/2870 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:06:41,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/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_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/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 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- 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 17:06:44,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:06:44,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:06:44,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:06:44,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:06:44,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:06:44,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:06:44,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:06:44,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:06:44,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:06:44,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:06:44,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:06:44,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:06:44,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:06:44,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:06:44,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:06:44,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:06:44,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:06:44,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:06:44,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:06:44,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:06:44,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:06:44,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:06:44,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:06:44,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:06:44,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:06:44,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:06:44,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:06:44,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:06:44,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:06:44,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:06:44,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:06:44,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:06:44,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:06:44,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:06:44,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:06:44,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:06:44,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:06:44,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:06:44,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:06:44,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:06:44,483 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-25 17:06:44,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:06:44,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:06:44,527 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:06:44,527 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:06:44,528 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:06:44,528 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:06:44,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:06:44,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:06:44,530 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:06:44,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:06:44,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:06:44,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:06:44,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:06:44,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:06:44,532 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:06:44,533 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:06:44,533 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:06:44,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:06:44,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:06:44,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:06:44,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:06:44,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:06:44,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:06:44,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:06:44,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:06:44,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:06:44,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:06:44,536 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:06:44,536 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:06:44,536 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:06:44,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:06:44,537 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:06:44,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:06:44,538 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:06:44,538 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_51ac1e91-a740-4d9d-bd9b-1de456540c04/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_51ac1e91-a740-4d9d-bd9b-1de456540c04/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 -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2022-11-25 17:06:44,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:06:44,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:06:44,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:06:44,993 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:06:44,993 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:06:44,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-25 17:06:48,531 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:06:49,080 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:06:49,081 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-25 17:06:49,124 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/data/13b7777d3/90f3a2bfaf6743cbbcbff640562455aa/FLAGddd099d65 [2022-11-25 17:06:49,150 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/data/13b7777d3/90f3a2bfaf6743cbbcbff640562455aa [2022-11-25 17:06:49,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:06:49,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:06:49,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:06:49,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:06:49,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:06:49,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:06:49" (1/1) ... [2022-11-25 17:06:49,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5411e8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:49, skipping insertion in model container [2022-11-25 17:06:49,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:06:49" (1/1) ... [2022-11-25 17:06:49,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:06:49,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:06:50,137 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 17:06:50,142 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 17:06:50,180 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:50,257 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-11-25 17:06:50,263 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-11-25 17:06:50,280 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:06:50,284 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:06:50,288 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:06:50,320 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 17:06:50,336 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-11-25 17:06:50,352 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-11-25 17:06:50,361 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-11-25 17:06:50,363 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:06:50,365 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:06:50,366 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:06:50,374 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:50,375 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:50,376 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:50,378 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:50,410 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:50,415 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:50,429 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-11-25 17:06:50,431 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-11-25 17:06:50,433 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-11-25 17:06:50,436 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 17:06:50,441 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-11-25 17:06:50,447 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-11-25 17:06:50,449 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 17:06:50,457 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 17:06:50,479 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-11-25 17:06:50,488 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-11-25 17:06:50,492 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_urb [2022-11-25 17:06:50,496 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-11-25 17:06:50,496 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-11-25 17:06:50,500 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_51ac1e91-a740-4d9d-bd9b-1de456540c04/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-11-25 17:06:50,512 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:50,517 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:50,533 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:50,568 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:50,571 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:50,573 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:50,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:06:50,627 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 17:06:50,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:06:50,827 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 17:06:50,829 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 17:06:50,834 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:50,851 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-11-25 17:06:50,853 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-11-25 17:06:50,856 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:06:50,857 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:06:50,859 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:06:50,868 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 17:06:50,873 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-11-25 17:06:50,883 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-11-25 17:06:50,887 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-11-25 17:06:50,890 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:06:50,893 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:06:50,895 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:06:50,898 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:50,899 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:50,900 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:50,906 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:50,907 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:50,907 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:50,914 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-11-25 17:06:50,916 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-11-25 17:06:50,917 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-11-25 17:06:50,917 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 17:06:50,918 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-11-25 17:06:50,920 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-11-25 17:06:50,921 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 17:06:50,957 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 17:06:50,958 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-11-25 17:06:50,962 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-11-25 17:06:50,963 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_urb [2022-11-25 17:06:50,964 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-11-25 17:06:50,965 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-11-25 17:06:50,965 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_51ac1e91-a740-4d9d-bd9b-1de456540c04/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-11-25 17:06:50,973 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:50,976 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:50,990 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:50,993 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:50,998 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:51,001 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:51,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:06:51,014 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:06:51,163 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 17:06:51,165 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 17:06:51,167 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:51,175 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-11-25 17:06:51,176 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-11-25 17:06:51,176 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:06:51,177 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:06:51,178 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 17:06:51,202 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 17:06:51,204 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-11-25 17:06:51,207 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-11-25 17:06:51,210 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-11-25 17:06:51,212 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:06:51,222 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:06:51,223 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 17:06:51,231 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:51,234 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:51,235 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:51,237 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:51,238 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:51,238 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 17:06:51,240 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-11-25 17:06:51,240 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-11-25 17:06:51,241 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-11-25 17:06:51,241 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 17:06:51,242 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-11-25 17:06:51,243 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-11-25 17:06:51,244 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 17:06:51,250 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 17:06:51,251 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-11-25 17:06:51,257 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-11-25 17:06:51,260 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_urb [2022-11-25 17:06:51,261 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-11-25 17:06:51,263 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-11-25 17:06:51,264 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_51ac1e91-a740-4d9d-bd9b-1de456540c04/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-11-25 17:06:51,267 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:51,268 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:51,270 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:51,274 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:51,276 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:51,277 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-11-25 17:06:51,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:06:51,344 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:06:51,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:51 WrapperNode [2022-11-25 17:06:51,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:06:51,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:06:51,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:06:51,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:06:51,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:51" (1/1) ... [2022-11-25 17:06:51,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:51" (1/1) ... [2022-11-25 17:06:51,538 INFO L138 Inliner]: procedures = 118, calls = 318, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 771 [2022-11-25 17:06:51,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:06:51,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:06:51,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:06:51,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:06:51,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:51" (1/1) ... [2022-11-25 17:06:51,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:51" (1/1) ... [2022-11-25 17:06:51,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:51" (1/1) ... [2022-11-25 17:06:51,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:51" (1/1) ... [2022-11-25 17:06:51,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:51" (1/1) ... [2022-11-25 17:06:51,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:51" (1/1) ... [2022-11-25 17:06:51,659 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:51" (1/1) ... [2022-11-25 17:06:51,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:51" (1/1) ... [2022-11-25 17:06:51,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:06:51,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:06:51,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:06:51,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:06:51,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:51" (1/1) ... [2022-11-25 17:06:51,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:06:51,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:51,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:06:51,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:06:51,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 17:06:51,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-25 17:06:51,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 17:06:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-11-25 17:06:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-25 17:06:51,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-25 17:06:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-25 17:06:51,804 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-25 17:06:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-25 17:06:51,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-25 17:06:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-25 17:06:51,806 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-25 17:06:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-25 17:06:51,807 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-25 17:06:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-25 17:06:51,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-25 17:06:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-25 17:06:51,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-25 17:06:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-11-25 17:06:51,808 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-11-25 17:06:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-25 17:06:51,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-25 17:06:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 17:06:51,808 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 17:06:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:06:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:06:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-25 17:06:51,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-25 17:06:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 17:06:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-25 17:06:51,811 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-25 17:06:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-25 17:06:51,811 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-25 17:06:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-11-25 17:06:51,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-11-25 17:06:51,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 17:06:51,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-25 17:06:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-11-25 17:06:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-11-25 17:06:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:06:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 17:06:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 17:06:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-11-25 17:06:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-25 17:06:51,814 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-25 17:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-25 17:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-11-25 17:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-25 17:06:51,816 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-25 17:06:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:06:51,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:06:52,373 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:06:52,376 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:06:52,540 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-25 17:06:59,092 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:06:59,101 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:06:59,102 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 17:06:59,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:06:59 BoogieIcfgContainer [2022-11-25 17:06:59,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:06:59,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:06:59,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:06:59,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:06:59,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:06:49" (1/3) ... [2022-11-25 17:06:59,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c4ec22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:06:59, skipping insertion in model container [2022-11-25 17:06:59,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:51" (2/3) ... [2022-11-25 17:06:59,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c4ec22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:06:59, skipping insertion in model container [2022-11-25 17:06:59,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:06:59" (3/3) ... [2022-11-25 17:06:59,118 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-25 17:06:59,140 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:06:59,140 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:06:59,213 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:06:59,218 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;@2c3295c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:06:59,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:06:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 172 states have (on average 1.319767441860465) internal successors, (227), 183 states have internal predecessors, (227), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-11-25 17:06:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 17:06:59,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:59,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:59,236 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:06:59,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:59,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1744056524, now seen corresponding path program 1 times [2022-11-25 17:06:59,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:06:59,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326888316] [2022-11-25 17:06:59,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:59,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:06:59,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:06:59,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:06:59,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 17:06:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:06:59,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:59,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:06:59,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:06:59,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326888316] [2022-11-25 17:06:59,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326888316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:59,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:59,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:06:59,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962189970] [2022-11-25 17:06:59,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:59,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:06:59,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:06:59,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:06:59,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:06:59,796 INFO L87 Difference]: Start difference. First operand has 232 states, 172 states have (on average 1.319767441860465) internal successors, (227), 183 states have internal predecessors, (227), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 17:06:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:59,853 INFO L93 Difference]: Finished difference Result 459 states and 624 transitions. [2022-11-25 17:06:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:06:59,855 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 32 [2022-11-25 17:06:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:59,866 INFO L225 Difference]: With dead ends: 459 [2022-11-25 17:06:59,866 INFO L226 Difference]: Without dead ends: 221 [2022-11-25 17:06:59,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 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 17:06:59,874 INFO L413 NwaCegarLoop]: 302 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, 302 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 17:06:59,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-25 17:06:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-11-25 17:06:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 167 states have (on average 1.2874251497005988) internal successors, (215), 172 states have internal predecessors, (215), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-25 17:06:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 289 transitions. [2022-11-25 17:06:59,946 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 289 transitions. Word has length 32 [2022-11-25 17:06:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:59,947 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 289 transitions. [2022-11-25 17:06:59,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 17:06:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 289 transitions. [2022-11-25 17:06:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 17:06:59,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:59,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:59,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-25 17:07:00,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:00,163 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:00,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:00,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2128208946, now seen corresponding path program 1 times [2022-11-25 17:07:00,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:00,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807482696] [2022-11-25 17:07:00,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:00,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:00,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:00,168 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:00,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 17:07:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:00,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:07:00,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:00,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:00,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:00,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807482696] [2022-11-25 17:07:00,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807482696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:00,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:00,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:07:00,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165955426] [2022-11-25 17:07:00,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:00,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:00,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:00,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:00,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:00,516 INFO L87 Difference]: Start difference. First operand 221 states and 289 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:07:00,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:00,663 INFO L93 Difference]: Finished difference Result 629 states and 826 transitions. [2022-11-25 17:07:00,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:00,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-25 17:07:00,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:00,668 INFO L225 Difference]: With dead ends: 629 [2022-11-25 17:07:00,668 INFO L226 Difference]: Without dead ends: 413 [2022-11-25 17:07:00,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:00,671 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 257 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:00,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 598 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:07:00,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-25 17:07:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2022-11-25 17:07:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 312 states have (on average 1.2820512820512822) internal successors, (400), 319 states have internal predecessors, (400), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-25 17:07:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 540 transitions. [2022-11-25 17:07:00,713 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 540 transitions. Word has length 32 [2022-11-25 17:07:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:00,714 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 540 transitions. [2022-11-25 17:07:00,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:07:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 540 transitions. [2022-11-25 17:07:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 17:07:00,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:00,717 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:00,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:00,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:00,935 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:00,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash 283881045, now seen corresponding path program 1 times [2022-11-25 17:07:00,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:00,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571006700] [2022-11-25 17:07:00,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:00,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:00,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:00,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:00,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 17:07:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:07:01,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:07:01,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:01,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:01,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571006700] [2022-11-25 17:07:01,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571006700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:01,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:01,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:07:01,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586580137] [2022-11-25 17:07:01,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:01,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:01,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:01,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:01,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:01,423 INFO L87 Difference]: Start difference. First operand 413 states and 540 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:07:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:01,874 INFO L93 Difference]: Finished difference Result 961 states and 1286 transitions. [2022-11-25 17:07:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:07:01,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-11-25 17:07:01,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:01,885 INFO L225 Difference]: With dead ends: 961 [2022-11-25 17:07:01,886 INFO L226 Difference]: Without dead ends: 563 [2022-11-25 17:07:01,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:07:01,894 INFO L413 NwaCegarLoop]: 457 mSDtfsCounter, 625 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:01,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1116 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:07:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-11-25 17:07:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 416. [2022-11-25 17:07:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 315 states have (on average 1.276190476190476) internal successors, (402), 322 states have internal predecessors, (402), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-25 17:07:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 542 transitions. [2022-11-25 17:07:02,005 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 542 transitions. Word has length 55 [2022-11-25 17:07:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:02,006 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 542 transitions. [2022-11-25 17:07:02,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:07:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 542 transitions. [2022-11-25 17:07:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 17:07:02,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:02,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:02,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:02,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:02,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:02,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:02,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1021197717, now seen corresponding path program 1 times [2022-11-25 17:07:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:02,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031959058] [2022-11-25 17:07:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:02,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:02,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:02,236 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:02,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 17:07:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:07:02,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:07:02,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:02,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:02,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031959058] [2022-11-25 17:07:02,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031959058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:02,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:02,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:02,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233717557] [2022-11-25 17:07:02,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:02,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:02,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:02,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:02,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:02,808 INFO L87 Difference]: Start difference. First operand 416 states and 542 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:07:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:02,947 INFO L93 Difference]: Finished difference Result 1211 states and 1587 transitions. [2022-11-25 17:07:02,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:02,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-11-25 17:07:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:02,955 INFO L225 Difference]: With dead ends: 1211 [2022-11-25 17:07:02,956 INFO L226 Difference]: Without dead ends: 810 [2022-11-25 17:07:02,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:02,960 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 245 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:02,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 659 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:07:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-11-25 17:07:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2022-11-25 17:07:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 616 states have (on average 1.271103896103896) internal successors, (783), 627 states have internal predecessors, (783), 137 states have call successors, (137), 55 states have call predecessors, (137), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-25 17:07:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1053 transitions. [2022-11-25 17:07:03,083 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1053 transitions. Word has length 55 [2022-11-25 17:07:03,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:03,084 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 1053 transitions. [2022-11-25 17:07:03,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:07:03,084 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1053 transitions. [2022-11-25 17:07:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 17:07:03,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:03,088 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:03,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:03,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:03,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:03,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:03,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1592367837, now seen corresponding path program 1 times [2022-11-25 17:07:03,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:03,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186053552] [2022-11-25 17:07:03,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:03,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:03,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:03,303 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:03,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 17:07:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:03,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:07:03,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:07:03,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:03,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:03,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186053552] [2022-11-25 17:07:03,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186053552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:03,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:03,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:03,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370774499] [2022-11-25 17:07:03,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:03,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:03,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:03,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:03,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:03,906 INFO L87 Difference]: Start difference. First operand 808 states and 1053 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:07:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:04,017 INFO L93 Difference]: Finished difference Result 810 states and 1054 transitions. [2022-11-25 17:07:04,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:04,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2022-11-25 17:07:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:04,023 INFO L225 Difference]: With dead ends: 810 [2022-11-25 17:07:04,024 INFO L226 Difference]: Without dead ends: 807 [2022-11-25 17:07:04,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:04,025 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 247 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:04,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 286 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:07:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-11-25 17:07:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2022-11-25 17:07:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 616 states have (on average 1.2694805194805194) internal successors, (782), 626 states have internal predecessors, (782), 136 states have call successors, (136), 55 states have call predecessors, (136), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-25 17:07:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1051 transitions. [2022-11-25 17:07:04,135 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1051 transitions. Word has length 56 [2022-11-25 17:07:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:04,137 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 1051 transitions. [2022-11-25 17:07:04,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:07:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1051 transitions. [2022-11-25 17:07:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 17:07:04,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:04,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:04,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:04,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:04,356 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2118777240, now seen corresponding path program 1 times [2022-11-25 17:07:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:04,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49388222] [2022-11-25 17:07:04,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:04,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:04,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:04,359 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:04,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 17:07:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:07:04,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:07:04,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:04,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:04,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49388222] [2022-11-25 17:07:04,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49388222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:04,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:04,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:04,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959380013] [2022-11-25 17:07:04,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:04,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:04,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:04,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:04,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:04,922 INFO L87 Difference]: Start difference. First operand 807 states and 1051 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:07:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:05,038 INFO L93 Difference]: Finished difference Result 809 states and 1052 transitions. [2022-11-25 17:07:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:05,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-11-25 17:07:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:05,044 INFO L225 Difference]: With dead ends: 809 [2022-11-25 17:07:05,044 INFO L226 Difference]: Without dead ends: 806 [2022-11-25 17:07:05,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:05,046 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:05,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 284 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:07:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-11-25 17:07:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2022-11-25 17:07:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 616 states have (on average 1.2678571428571428) internal successors, (781), 625 states have internal predecessors, (781), 135 states have call successors, (135), 55 states have call predecessors, (135), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-25 17:07:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1049 transitions. [2022-11-25 17:07:05,191 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1049 transitions. Word has length 57 [2022-11-25 17:07:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:05,192 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1049 transitions. [2022-11-25 17:07:05,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:07:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1049 transitions. [2022-11-25 17:07:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 17:07:05,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:05,194 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:05,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:05,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:05,407 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1257604416, now seen corresponding path program 1 times [2022-11-25 17:07:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:05,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377304814] [2022-11-25 17:07:05,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:05,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:05,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:05,410 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:05,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 17:07:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:07:05,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:07:05,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:05,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:05,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377304814] [2022-11-25 17:07:05,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377304814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:05,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:05,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:05,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371654884] [2022-11-25 17:07:05,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:05,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:05,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:05,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:05,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:05,964 INFO L87 Difference]: Start difference. First operand 806 states and 1049 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:07:06,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:06,066 INFO L93 Difference]: Finished difference Result 808 states and 1050 transitions. [2022-11-25 17:07:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:06,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 58 [2022-11-25 17:07:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:06,071 INFO L225 Difference]: With dead ends: 808 [2022-11-25 17:07:06,071 INFO L226 Difference]: Without dead ends: 797 [2022-11-25 17:07:06,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:06,073 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 241 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 283 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 17:07:06,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:07:06,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2022-11-25 17:07:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2022-11-25 17:07:06,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 608 states have (on average 1.2664473684210527) internal successors, (770), 616 states have internal predecessors, (770), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-25 17:07:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1037 transitions. [2022-11-25 17:07:06,208 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1037 transitions. Word has length 58 [2022-11-25 17:07:06,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:06,209 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1037 transitions. [2022-11-25 17:07:06,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:07:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1037 transitions. [2022-11-25 17:07:06,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-11-25 17:07:06,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:06,213 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:07:06,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:06,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:06,427 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:06,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash 89004713, now seen corresponding path program 1 times [2022-11-25 17:07:06,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:06,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279959859] [2022-11-25 17:07:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:06,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:06,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:06,430 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:06,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 17:07:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:06,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:07:06,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-25 17:07:07,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:07,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:07,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279959859] [2022-11-25 17:07:07,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279959859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:07,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:07,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:07:07,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205633216] [2022-11-25 17:07:07,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:07,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:07,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:07,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:07,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:07,009 INFO L87 Difference]: Start difference. First operand 797 states and 1037 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 17:07:07,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:07,218 INFO L93 Difference]: Finished difference Result 1643 states and 2145 transitions. [2022-11-25 17:07:07,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:07,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 152 [2022-11-25 17:07:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:07,223 INFO L225 Difference]: With dead ends: 1643 [2022-11-25 17:07:07,223 INFO L226 Difference]: Without dead ends: 861 [2022-11-25 17:07:07,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:07,226 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 41 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:07,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 547 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:07:07,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2022-11-25 17:07:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 851. [2022-11-25 17:07:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 661 states have (on average 1.2768532526475038) internal successors, (844), 669 states have internal predecessors, (844), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-25 17:07:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1111 transitions. [2022-11-25 17:07:07,335 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1111 transitions. Word has length 152 [2022-11-25 17:07:07,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:07,336 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 1111 transitions. [2022-11-25 17:07:07,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 17:07:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1111 transitions. [2022-11-25 17:07:07,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-25 17:07:07,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:07,342 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:07:07,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:07,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:07,560 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:07,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:07,560 INFO L85 PathProgramCache]: Analyzing trace with hash 478785898, now seen corresponding path program 1 times [2022-11-25 17:07:07,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:07,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029919660] [2022-11-25 17:07:07,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:07,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:07,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:07,562 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:07,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 17:07:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:08,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:07:08,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-25 17:07:08,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:08,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:08,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029919660] [2022-11-25 17:07:08,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029919660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:08,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:08,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:07:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728291787] [2022-11-25 17:07:08,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:08,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:08,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:08,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:08,248 INFO L87 Difference]: Start difference. First operand 851 states and 1111 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:07:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:08,488 INFO L93 Difference]: Finished difference Result 1711 states and 2259 transitions. [2022-11-25 17:07:08,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:07:08,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 161 [2022-11-25 17:07:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:08,494 INFO L225 Difference]: With dead ends: 1711 [2022-11-25 17:07:08,495 INFO L226 Difference]: Without dead ends: 879 [2022-11-25 17:07:08,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:07:08,498 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 1 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:08,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1112 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:07:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2022-11-25 17:07:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 867. [2022-11-25 17:07:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 673 states have (on average 1.2719167904903417) internal successors, (856), 681 states have internal predecessors, (856), 134 states have call successors, (134), 56 states have call predecessors, (134), 59 states have return successors, (153), 137 states have call predecessors, (153), 133 states have call successors, (153) [2022-11-25 17:07:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1143 transitions. [2022-11-25 17:07:08,673 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1143 transitions. Word has length 161 [2022-11-25 17:07:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:08,674 INFO L495 AbstractCegarLoop]: Abstraction has 867 states and 1143 transitions. [2022-11-25 17:07:08,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:07:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1143 transitions. [2022-11-25 17:07:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-25 17:07:08,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:08,678 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:07:08,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:08,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:08,891 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:08,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:08,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2130922114, now seen corresponding path program 1 times [2022-11-25 17:07:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:08,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822945800] [2022-11-25 17:07:08,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:08,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:08,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:08,894 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:08,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 17:07:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:09,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:07:09,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-25 17:07:09,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:09,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:09,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822945800] [2022-11-25 17:07:09,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822945800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:09,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:09,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:07:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916270512] [2022-11-25 17:07:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:09,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:09,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:09,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:09,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:09,564 INFO L87 Difference]: Start difference. First operand 867 states and 1143 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 17:07:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:09,840 INFO L93 Difference]: Finished difference Result 2293 states and 3096 transitions. [2022-11-25 17:07:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:07:09,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 167 [2022-11-25 17:07:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:09,848 INFO L225 Difference]: With dead ends: 2293 [2022-11-25 17:07:09,848 INFO L226 Difference]: Without dead ends: 1445 [2022-11-25 17:07:09,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:07:09,851 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 322 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:09,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1371 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:07:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2022-11-25 17:07:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 879. [2022-11-25 17:07:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 685 states have (on average 1.2671532846715328) internal successors, (868), 693 states have internal predecessors, (868), 134 states have call successors, (134), 56 states have call predecessors, (134), 59 states have return successors, (153), 137 states have call predecessors, (153), 133 states have call successors, (153) [2022-11-25 17:07:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1155 transitions. [2022-11-25 17:07:09,973 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1155 transitions. Word has length 167 [2022-11-25 17:07:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:09,973 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1155 transitions. [2022-11-25 17:07:09,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 17:07:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1155 transitions. [2022-11-25 17:07:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-25 17:07:09,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:09,978 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:07:10,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:10,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:10,191 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:10,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1336268347, now seen corresponding path program 1 times [2022-11-25 17:07:10,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:10,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807761303] [2022-11-25 17:07:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:10,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:10,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:10,193 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:10,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 17:07:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:10,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 17:07:10,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-25 17:07:11,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:11,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:11,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807761303] [2022-11-25 17:07:11,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807761303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:11,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:11,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 17:07:11,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862178560] [2022-11-25 17:07:11,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:11,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:07:11,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:11,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:07:11,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:07:11,169 INFO L87 Difference]: Start difference. First operand 879 states and 1155 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 17:07:13,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 17:07:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:14,663 INFO L93 Difference]: Finished difference Result 2287 states and 3081 transitions. [2022-11-25 17:07:14,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:07:14,664 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 169 [2022-11-25 17:07:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:14,670 INFO L225 Difference]: With dead ends: 2287 [2022-11-25 17:07:14,670 INFO L226 Difference]: Without dead ends: 1427 [2022-11-25 17:07:14,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:07:14,673 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 203 mSDsluCounter, 2986 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:14,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 3377 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-11-25 17:07:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2022-11-25 17:07:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 911. [2022-11-25 17:07:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 713 states have (on average 1.2566619915848527) internal successors, (896), 717 states have internal predecessors, (896), 134 states have call successors, (134), 56 states have call predecessors, (134), 63 states have return successors, (161), 145 states have call predecessors, (161), 133 states have call successors, (161) [2022-11-25 17:07:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1191 transitions. [2022-11-25 17:07:14,822 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1191 transitions. Word has length 169 [2022-11-25 17:07:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:14,822 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1191 transitions. [2022-11-25 17:07:14,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 17:07:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1191 transitions. [2022-11-25 17:07:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-25 17:07:14,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:14,827 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:07:14,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:15,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:15,043 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:15,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash -981805263, now seen corresponding path program 2 times [2022-11-25 17:07:15,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:15,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395899299] [2022-11-25 17:07:15,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:07:15,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:15,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:15,051 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:15,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 17:07:15,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:07:15,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:07:15,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 17:07:15,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-25 17:07:15,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:15,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:15,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395899299] [2022-11-25 17:07:15,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395899299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:15,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:15,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:07:15,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270861526] [2022-11-25 17:07:15,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:15,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:07:15,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:15,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:07:15,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:07:15,686 INFO L87 Difference]: Start difference. First operand 911 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 17:07:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:17,278 INFO L93 Difference]: Finished difference Result 1849 states and 2509 transitions. [2022-11-25 17:07:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:07:17,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 175 [2022-11-25 17:07:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:17,286 INFO L225 Difference]: With dead ends: 1849 [2022-11-25 17:07:17,287 INFO L226 Difference]: Without dead ends: 1399 [2022-11-25 17:07:17,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:07:17,289 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 590 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:17,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1814 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 17:07:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2022-11-25 17:07:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 917. [2022-11-25 17:07:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 719 states have (on average 1.25452016689847) internal successors, (902), 723 states have internal predecessors, (902), 134 states have call successors, (134), 56 states have call predecessors, (134), 63 states have return successors, (161), 145 states have call predecessors, (161), 133 states have call successors, (161) [2022-11-25 17:07:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1197 transitions. [2022-11-25 17:07:17,442 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1197 transitions. Word has length 175 [2022-11-25 17:07:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:17,442 INFO L495 AbstractCegarLoop]: Abstraction has 917 states and 1197 transitions. [2022-11-25 17:07:17,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 17:07:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1197 transitions. [2022-11-25 17:07:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-11-25 17:07:17,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:17,448 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:07:17,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:17,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:17,673 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:17,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:17,674 INFO L85 PathProgramCache]: Analyzing trace with hash 329175588, now seen corresponding path program 1 times [2022-11-25 17:07:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:17,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199880677] [2022-11-25 17:07:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:17,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:17,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:17,676 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:17,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 17:07:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:18,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 17:07:18,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-25 17:07:19,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-25 17:07:20,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:20,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199880677] [2022-11-25 17:07:20,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199880677] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:20,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:20,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-25 17:07:20,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478689037] [2022-11-25 17:07:20,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:20,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 17:07:20,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:20,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 17:07:20,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-25 17:07:20,094 INFO L87 Difference]: Start difference. First operand 917 states and 1197 transitions. Second operand has 16 states, 16 states have (on average 9.25) internal successors, (148), 12 states have internal predecessors, (148), 4 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (27), 8 states have call predecessors, (27), 4 states have call successors, (27) [2022-11-25 17:07:22,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 17:07:24,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 17:07:25,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:25,030 INFO L93 Difference]: Finished difference Result 2041 states and 2694 transitions. [2022-11-25 17:07:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:07:25,033 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 12 states have internal predecessors, (148), 4 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (27), 8 states have call predecessors, (27), 4 states have call successors, (27) Word has length 203 [2022-11-25 17:07:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:25,043 INFO L225 Difference]: With dead ends: 2041 [2022-11-25 17:07:25,043 INFO L226 Difference]: Without dead ends: 1143 [2022-11-25 17:07:25,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-11-25 17:07:25,046 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 61 mSDsluCounter, 4176 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 4512 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:25,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 4512 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2022-11-25 17:07:25,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-11-25 17:07:25,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 925. [2022-11-25 17:07:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 723 states have (on average 1.2531120331950207) internal successors, (906), 727 states have internal predecessors, (906), 138 states have call successors, (138), 56 states have call predecessors, (138), 63 states have return successors, (169), 149 states have call predecessors, (169), 137 states have call successors, (169) [2022-11-25 17:07:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1213 transitions. [2022-11-25 17:07:25,200 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1213 transitions. Word has length 203 [2022-11-25 17:07:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:25,201 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1213 transitions. [2022-11-25 17:07:25,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 12 states have internal predecessors, (148), 4 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (27), 8 states have call predecessors, (27), 4 states have call successors, (27) [2022-11-25 17:07:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1213 transitions. [2022-11-25 17:07:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-25 17:07:25,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:25,206 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:07:25,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:25,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:25,428 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1423611720, now seen corresponding path program 2 times [2022-11-25 17:07:25,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:25,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293204370] [2022-11-25 17:07:25,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:07:25,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:25,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:25,431 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:25,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-25 17:07:26,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:07:26,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:07:26,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:07:26,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-11-25 17:07:27,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-11-25 17:07:27,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:27,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293204370] [2022-11-25 17:07:27,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293204370] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:27,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:27,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-25 17:07:27,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481076962] [2022-11-25 17:07:27,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:27,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:07:27,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:27,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:07:27,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:07:27,927 INFO L87 Difference]: Start difference. First operand 925 states and 1213 transitions. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 4 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-11-25 17:07:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:30,806 INFO L93 Difference]: Finished difference Result 5448 states and 7175 transitions. [2022-11-25 17:07:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:07:30,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 4 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 209 [2022-11-25 17:07:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:30,829 INFO L225 Difference]: With dead ends: 5448 [2022-11-25 17:07:30,830 INFO L226 Difference]: Without dead ends: 5440 [2022-11-25 17:07:30,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:07:30,833 INFO L413 NwaCegarLoop]: 696 mSDtfsCounter, 1079 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:30,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 1993 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-25 17:07:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2022-11-25 17:07:31,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5407. [2022-11-25 17:07:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5407 states, 4235 states have (on average 1.2578512396694215) internal successors, (5327), 4267 states have internal predecessors, (5327), 808 states have call successors, (808), 316 states have call predecessors, (808), 363 states have return successors, (999), 871 states have call predecessors, (999), 807 states have call successors, (999) [2022-11-25 17:07:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5407 states to 5407 states and 7134 transitions. [2022-11-25 17:07:31,948 INFO L78 Accepts]: Start accepts. Automaton has 5407 states and 7134 transitions. Word has length 209 [2022-11-25 17:07:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:31,949 INFO L495 AbstractCegarLoop]: Abstraction has 5407 states and 7134 transitions. [2022-11-25 17:07:31,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 4 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-11-25 17:07:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5407 states and 7134 transitions. [2022-11-25 17:07:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-25 17:07:31,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:31,960 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:07:31,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:32,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:32,175 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:32,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:32,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1860238326, now seen corresponding path program 1 times [2022-11-25 17:07:32,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:32,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852778024] [2022-11-25 17:07:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:32,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:32,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:32,178 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:32,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-25 17:07:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:33,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 17:07:33,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-25 17:07:33,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:33,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:33,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852778024] [2022-11-25 17:07:33,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852778024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:33,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:33,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:07:33,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579743701] [2022-11-25 17:07:33,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:33,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:07:33,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:33,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:07:33,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:07:33,406 INFO L87 Difference]: Start difference. First operand 5407 states and 7134 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-25 17:07:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:34,978 INFO L93 Difference]: Finished difference Result 13073 states and 17607 transitions. [2022-11-25 17:07:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:07:34,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 209 [2022-11-25 17:07:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:35,022 INFO L225 Difference]: With dead ends: 13073 [2022-11-25 17:07:35,022 INFO L226 Difference]: Without dead ends: 7685 [2022-11-25 17:07:35,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:07:35,040 INFO L413 NwaCegarLoop]: 394 mSDtfsCounter, 93 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:35,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1853 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:07:35,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7685 states. [2022-11-25 17:07:36,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7685 to 5479. [2022-11-25 17:07:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5479 states, 4307 states have (on average 1.2535407476201532) internal successors, (5399), 4315 states have internal predecessors, (5399), 808 states have call successors, (808), 316 states have call predecessors, (808), 363 states have return successors, (999), 895 states have call predecessors, (999), 807 states have call successors, (999) [2022-11-25 17:07:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 7206 transitions. [2022-11-25 17:07:36,479 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 7206 transitions. Word has length 209 [2022-11-25 17:07:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:36,480 INFO L495 AbstractCegarLoop]: Abstraction has 5479 states and 7206 transitions. [2022-11-25 17:07:36,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-25 17:07:36,481 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 7206 transitions. [2022-11-25 17:07:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-11-25 17:07:36,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:36,497 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:07:36,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:36,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:36,721 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:36,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2085141046, now seen corresponding path program 2 times [2022-11-25 17:07:36,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:36,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48247902] [2022-11-25 17:07:36,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:07:36,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:36,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:36,724 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:36,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-25 17:07:37,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:07:37,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:07:37,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:07:37,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-11-25 17:07:37,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:37,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:37,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48247902] [2022-11-25 17:07:37,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48247902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:37,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:37,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:07:37,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300903909] [2022-11-25 17:07:37,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:37,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:07:37,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:37,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:07:37,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:07:37,287 INFO L87 Difference]: Start difference. First operand 5479 states and 7206 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-25 17:07:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:39,256 INFO L93 Difference]: Finished difference Result 17429 states and 23042 transitions. [2022-11-25 17:07:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:07:39,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 215 [2022-11-25 17:07:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:39,306 INFO L225 Difference]: With dead ends: 17429 [2022-11-25 17:07:39,306 INFO L226 Difference]: Without dead ends: 11969 [2022-11-25 17:07:39,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:39,321 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 337 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:39,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 957 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:07:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11969 states. [2022-11-25 17:07:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11969 to 5503. [2022-11-25 17:07:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5503 states, 4331 states have (on average 1.252135765412145) internal successors, (5423), 4347 states have internal predecessors, (5423), 808 states have call successors, (808), 316 states have call predecessors, (808), 363 states have return successors, (999), 887 states have call predecessors, (999), 807 states have call successors, (999) [2022-11-25 17:07:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5503 states to 5503 states and 7230 transitions. [2022-11-25 17:07:40,715 INFO L78 Accepts]: Start accepts. Automaton has 5503 states and 7230 transitions. Word has length 215 [2022-11-25 17:07:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:40,716 INFO L495 AbstractCegarLoop]: Abstraction has 5503 states and 7230 transitions. [2022-11-25 17:07:40,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-25 17:07:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 5503 states and 7230 transitions. [2022-11-25 17:07:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-11-25 17:07:40,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:40,733 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:07:40,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:40,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:40,950 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:40,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1577658726, now seen corresponding path program 1 times [2022-11-25 17:07:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:40,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123783234] [2022-11-25 17:07:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:40,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:40,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:40,955 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:40,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-25 17:07:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:42,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 17:07:42,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-25 17:07:42,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:42,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:42,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123783234] [2022-11-25 17:07:42,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123783234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:42,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:42,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:07:42,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960216644] [2022-11-25 17:07:42,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:42,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:07:42,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:42,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:07:42,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:07:42,378 INFO L87 Difference]: Start difference. First operand 5503 states and 7230 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-25 17:07:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:44,324 INFO L93 Difference]: Finished difference Result 12129 states and 16597 transitions. [2022-11-25 17:07:44,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:07:44,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 222 [2022-11-25 17:07:44,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:44,359 INFO L225 Difference]: With dead ends: 12129 [2022-11-25 17:07:44,359 INFO L226 Difference]: Without dead ends: 9365 [2022-11-25 17:07:44,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 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 17:07:44,369 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 304 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:44,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1865 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:07:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2022-11-25 17:07:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 5575. [2022-11-25 17:07:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5575 states, 4403 states have (on average 1.248012718600954) internal successors, (5495), 4395 states have internal predecessors, (5495), 808 states have call successors, (808), 316 states have call predecessors, (808), 363 states have return successors, (999), 911 states have call predecessors, (999), 807 states have call successors, (999) [2022-11-25 17:07:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 7302 transitions. [2022-11-25 17:07:45,689 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 7302 transitions. Word has length 222 [2022-11-25 17:07:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:45,690 INFO L495 AbstractCegarLoop]: Abstraction has 5575 states and 7302 transitions. [2022-11-25 17:07:45,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-25 17:07:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 7302 transitions. [2022-11-25 17:07:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-11-25 17:07:45,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:45,702 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:07:45,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:45,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:45,927 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:45,928 INFO L85 PathProgramCache]: Analyzing trace with hash -794308218, now seen corresponding path program 2 times [2022-11-25 17:07:45,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:45,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136542749] [2022-11-25 17:07:45,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:07:45,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:45,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:45,931 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:45,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-25 17:07:47,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:07:47,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:07:48,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:07:48,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-11-25 17:07:48,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:48,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:48,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136542749] [2022-11-25 17:07:48,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136542749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:48,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:48,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:07:48,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29888215] [2022-11-25 17:07:48,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:48,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:48,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:48,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:48,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:48,166 INFO L87 Difference]: Start difference. First operand 5575 states and 7302 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-25 17:07:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:49,286 INFO L93 Difference]: Finished difference Result 11179 states and 14633 transitions. [2022-11-25 17:07:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:07:49,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 228 [2022-11-25 17:07:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:49,309 INFO L225 Difference]: With dead ends: 11179 [2022-11-25 17:07:49,310 INFO L226 Difference]: Without dead ends: 5575 [2022-11-25 17:07:49,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:49,329 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 0 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:49,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1105 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:07:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5575 states. [2022-11-25 17:07:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5575 to 5575. [2022-11-25 17:07:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5575 states, 4403 states have (on average 1.248012718600954) internal successors, (5495), 4395 states have internal predecessors, (5495), 808 states have call successors, (808), 316 states have call predecessors, (808), 363 states have return successors, (975), 911 states have call predecessors, (975), 807 states have call successors, (975) [2022-11-25 17:07:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 7278 transitions. [2022-11-25 17:07:51,028 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 7278 transitions. Word has length 228 [2022-11-25 17:07:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:51,029 INFO L495 AbstractCegarLoop]: Abstraction has 5575 states and 7278 transitions. [2022-11-25 17:07:51,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-25 17:07:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 7278 transitions. [2022-11-25 17:07:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-11-25 17:07:51,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:51,133 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:07:51,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:51,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:51,334 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:51,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:51,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1382682662, now seen corresponding path program 1 times [2022-11-25 17:07:51,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:51,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417333910] [2022-11-25 17:07:51,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:51,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:51,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:51,337 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:51,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-25 17:07:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:57,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-25 17:07:57,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:57,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 17:07:57,421 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 7 treesize of output 6 [2022-11-25 17:07:58,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 17:07:58,223 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2511 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2511))) is different from true [2022-11-25 17:07:58,257 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc66.base| (_ BitVec 64))) (and (exists ((v_ArrVal_2510 (_ BitVec 1))) (= (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc66.base| v_ArrVal_2510) |c_#valid|)) (= (select |c_old(#valid)| |ldv_init_zalloc_#t~malloc66.base|) (_ bv0 1)) (exists ((v_ArrVal_2511 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |ldv_init_zalloc_#t~malloc66.base| v_ArrVal_2511))))) is different from true [2022-11-25 17:07:58,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 17:07:58,297 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 17:07:58,437 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 17:07:58,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 17:07:58,457 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 13 treesize of output 15 [2022-11-25 17:07:58,677 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 7 treesize of output 5 [2022-11-25 17:08:04,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 17:08:11,360 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 17:08:11,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 17:08:12,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 17:08:17,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 17:08:19,048 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-25 17:08:29,954 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-25 17:08:29,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 17:08:30,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 17:08:45,742 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-25 17:08:45,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 17:08:48,349 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_6| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_6|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-25 17:08:48,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:08:50,731 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-25 17:08:51,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:08:51,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:08:53,363 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_8| (_ BitVec 64))) (= ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)) (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_8|))) is different from true [2022-11-25 17:08:53,604 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 13 treesize of output 15 [2022-11-25 17:08:53,619 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 13 treesize of output 15 [2022-11-25 17:08:53,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:53,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 110 [2022-11-25 17:08:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 86 proven. 18 refuted. 9 times theorem prover too weak. 17 trivial. 101 not checked. [2022-11-25 17:08:53,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:53,900 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ BitVec 64)) (v_ArrVal_2522 (Array (_ BitVec 64) (_ BitVec 8)))) (= (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2522) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|))) (concat (concat (concat (concat (concat (concat (concat (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv23 64))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv22 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv21 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv20 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv19 64)))) (select .cse0 (bvadd (_ bv18 64) |ULTIMATE.start_usb_acecad_probe_~id#1.offset|))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv17 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv16 64))))))) is different from false [2022-11-25 17:08:54,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:08:54,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417333910] [2022-11-25 17:08:54,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417333910] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:54,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [856249787] [2022-11-25 17:08:54,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:54,035 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 17:08:54,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 17:08:54,041 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 17:08:54,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51ac1e91-a740-4d9d-bd9b-1de456540c04/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-11-25 17:15:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-25 17:15:19,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:19,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 17:15:21,522 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 7 treesize of output 6 [2022-11-25 17:15:23,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 17:15:23,102 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2870 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2870))) is different from true [2022-11-25 17:15:23,123 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc66.base| (_ BitVec 64))) (and (exists ((v_ArrVal_2510 (_ BitVec 1))) (= (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc66.base| v_ArrVal_2510) |c_#valid|)) (= (select |c_old(#valid)| |ldv_init_zalloc_#t~malloc66.base|) (_ bv0 1)) (exists ((v_ArrVal_2870 (Array (_ BitVec 64) (_ BitVec 8)))) (= (store |c_old(#memory_int)| |ldv_init_zalloc_#t~malloc66.base| v_ArrVal_2870) |c_#memory_int|)))) is different from true [2022-11-25 17:15:23,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 17:15:23,156 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 17:15:23,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:23,214 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 13 treesize of output 15 [2022-11-25 17:15:23,260 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 17:15:23,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 17:15:23,619 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 7 treesize of output 5 [2022-11-25 17:15:27,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 17:15:34,561 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 17:15:34,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 17:15:36,991 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 7 treesize of output 5 [2022-11-25 17:15:39,179 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 17:15:39,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2022-11-25 17:15:41,646 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_13| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_13|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-25 17:15:58,283 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_14| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_14|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-25 17:15:58,698 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 13 treesize of output 15 [2022-11-25 17:16:00,738 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_15| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_15|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-25 17:16:01,203 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 13 treesize of output 15 [2022-11-25 17:16:01,236 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 13 treesize of output 15 [2022-11-25 17:16:03,541 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_16| (_ BitVec 64))) (= ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)) (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_16|))) is different from true [2022-11-25 17:16:03,998 INFO L321 Elim1Store]: treesize reduction 58, result has 23.7 percent of original size [2022-11-25 17:16:03,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 75 [2022-11-25 17:16:04,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:16:04,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:16:04,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:16:04,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:16:04,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:16:04,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:16:04,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:16:04,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:16:04,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:16:04,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 45 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 89 [2022-11-25 17:16:04,996 INFO L321 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-11-25 17:16:04,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 93 [2022-11-25 17:16:05,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-25 17:16:08,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:16:08,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 132 [2022-11-25 17:16:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 86 proven. 27 refuted. 0 times theorem prover too weak. 7 trivial. 111 not checked. [2022-11-25 17:16:08,234 INFO L328 TraceCheckSpWp]: Computing backward predicates...