./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8 --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 3acbab6b9aaee88273e5c2573b1301b2b4d4059e0d0ec0927c600e9ad855395b --- 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-2329fc7 [2022-12-13 14:23:43,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:23:43,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:23:43,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:23:43,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:23:43,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:23:43,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:23:43,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:23:43,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:23:43,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:23:43,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:23:43,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:23:43,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:23:43,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:23:43,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:23:43,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:23:43,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:23:43,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:23:43,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:23:43,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:23:43,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:23:43,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:23:43,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:23:43,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:23:43,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:23:43,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:23:43,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:23:43,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:23:43,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:23:43,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:23:43,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:23:43,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:23:43,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:23:43,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:23:43,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:23:43,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:23:43,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:23:43,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:23:43,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:23:43,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:23:43,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:23:43,225 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 14:23:43,246 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:23:43,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:23:43,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:23:43,247 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:23:43,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:23:43,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:23:43,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:23:43,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:23:43,249 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:23:43,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:23:43,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:23:43,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:23:43,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 14:23:43,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:23:43,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 14:23:43,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 14:23:43,250 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:23:43,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 14:23:43,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:23:43,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:23:43,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:23:43,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:23:43,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:23:43,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:23:43,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 14:23:43,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:23:43,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:23:43,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:23:43,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 14:23:43,252 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:23:43,253 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:23:43,253 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:23:43,253 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_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/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_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8 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 -> 3acbab6b9aaee88273e5c2573b1301b2b4d4059e0d0ec0927c600e9ad855395b [2022-12-13 14:23:43,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:23:43,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:23:43,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:23:43,445 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:23:43,445 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:23:43,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2022-12-13 14:23:46,078 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:23:46,335 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:23:46,335 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2022-12-13 14:23:46,351 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/data/c4da34eea/4919695ff3194fdab908aab41f4ab7ea/FLAG9cbad5b2b [2022-12-13 14:23:46,362 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/data/c4da34eea/4919695ff3194fdab908aab41f4ab7ea [2022-12-13 14:23:46,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:23:46,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:23:46,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:23:46,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:23:46,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:23:46,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:23:46" (1/1) ... [2022-12-13 14:23:46,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59932f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:46, skipping insertion in model container [2022-12-13 14:23:46,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:23:46" (1/1) ... [2022-12-13 14:23:46,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:23:46,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:23:47,007 WARN L623 FunctionHandler]: Unknown extern function usb_reset_device [2022-12-13 14:23:47,050 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 14:23:47,053 WARN L623 FunctionHandler]: Unknown extern function usbnet_probe [2022-12-13 14:23:47,055 WARN L623 FunctionHandler]: Unknown extern function usbnet_disconnect [2022-12-13 14:23:47,055 WARN L623 FunctionHandler]: Unknown extern function usbnet_disconnect [2022-12-13 14:23:47,056 WARN L623 FunctionHandler]: Unknown extern function usbnet_suspend [2022-12-13 14:23:47,057 WARN L623 FunctionHandler]: Unknown extern function usbnet_resume [2022-12-13 14:23:47,057 WARN L623 FunctionHandler]: Unknown extern function ldv_reset_resume_1 [2022-12-13 14:23:47,063 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:23:47,064 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:23:47,064 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:23:47,065 WARN L623 FunctionHandler]: Unknown extern function mutex_trylock [2022-12-13 14:23:47,066 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:23:47,067 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:23:47,067 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:23:47,068 WARN L623 FunctionHandler]: Unknown extern function __ldv_usb_unlock_device [2022-12-13 14:23:47,069 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 14:23:47,070 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 14:23:47,074 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_015e2399-f28d-47da-8237-5a4d774073c4/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i[185252,185265] [2022-12-13 14:23:47,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:23:47,279 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:23:47,395 WARN L623 FunctionHandler]: Unknown extern function usb_reset_device [2022-12-13 14:23:47,403 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 14:23:47,404 WARN L623 FunctionHandler]: Unknown extern function usbnet_probe [2022-12-13 14:23:47,405 WARN L623 FunctionHandler]: Unknown extern function usbnet_disconnect [2022-12-13 14:23:47,406 WARN L623 FunctionHandler]: Unknown extern function usbnet_disconnect [2022-12-13 14:23:47,406 WARN L623 FunctionHandler]: Unknown extern function usbnet_suspend [2022-12-13 14:23:47,406 WARN L623 FunctionHandler]: Unknown extern function usbnet_resume [2022-12-13 14:23:47,407 WARN L623 FunctionHandler]: Unknown extern function ldv_reset_resume_1 [2022-12-13 14:23:47,409 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:23:47,410 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:23:47,410 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:23:47,410 WARN L623 FunctionHandler]: Unknown extern function mutex_trylock [2022-12-13 14:23:47,411 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:23:47,411 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:23:47,411 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:23:47,412 WARN L623 FunctionHandler]: Unknown extern function __ldv_usb_unlock_device [2022-12-13 14:23:47,412 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 14:23:47,413 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 14:23:47,413 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_015e2399-f28d-47da-8237-5a4d774073c4/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i[185252,185265] [2022-12-13 14:23:47,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:23:47,453 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:23:47,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:47 WrapperNode [2022-12-13 14:23:47,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:23:47,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:23:47,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:23:47,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:23:47,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:47" (1/1) ... [2022-12-13 14:23:47,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:47" (1/1) ... [2022-12-13 14:23:47,529 INFO L138 Inliner]: procedures = 117, calls = 568, calls flagged for inlining = 30, calls inlined = 25, statements flattened = 1081 [2022-12-13 14:23:47,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:23:47,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:23:47,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:23:47,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:23:47,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:47" (1/1) ... [2022-12-13 14:23:47,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:47" (1/1) ... [2022-12-13 14:23:47,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:47" (1/1) ... [2022-12-13 14:23:47,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:47" (1/1) ... [2022-12-13 14:23:47,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:47" (1/1) ... [2022-12-13 14:23:47,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:47" (1/1) ... [2022-12-13 14:23:47,587 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:47" (1/1) ... [2022-12-13 14:23:47,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:47" (1/1) ... [2022-12-13 14:23:47,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:23:47,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:23:47,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:23:47,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:23:47,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:47" (1/1) ... [2022-12-13 14:23:47,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:23:47,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:23:47,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:23:47,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:23:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-12-13 14:23:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-12-13 14:23:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 14:23:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-12-13 14:23:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-12-13 14:23:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2022-12-13 14:23:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2022-12-13 14:23:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-12-13 14:23:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-12-13 14:23:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-12-13 14:23:47,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-12-13 14:23:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-12-13 14:23:47,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-12-13 14:23:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 14:23:47,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 14:23:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 14:23:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:23:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_udev [2022-12-13 14:23:47,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_udev [2022-12-13 14:23:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-12-13 14:23:47,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-12-13 14:23:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 14:23:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 14:23:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:23:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 14:23:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure always_connected [2022-12-13 14:23:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure always_connected [2022-12-13 14:23:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:23:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:23:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:23:47,861 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:23:47,863 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:23:47,913 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-12-13 14:23:48,483 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:23:48,489 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:23:48,490 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 14:23:48,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:23:48 BoogieIcfgContainer [2022-12-13 14:23:48,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:23:48,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:23:48,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:23:48,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:23:48,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:23:46" (1/3) ... [2022-12-13 14:23:48,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a689a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:23:48, skipping insertion in model container [2022-12-13 14:23:48,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:47" (2/3) ... [2022-12-13 14:23:48,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a689a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:23:48, skipping insertion in model container [2022-12-13 14:23:48,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:23:48" (3/3) ... [2022-12-13 14:23:48,499 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2022-12-13 14:23:48,513 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:23:48,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 14:23:48,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:23:48,568 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;@58d14b6e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:23:48,568 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 14:23:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 141 states have (on average 1.4539007092198581) internal successors, (205), 157 states have internal predecessors, (205), 34 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 14:23:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-13 14:23:48,586 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:23:48,587 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:23:48,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:23:48,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:23:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash 665515163, now seen corresponding path program 1 times [2022-12-13 14:23:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:23:48,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904124833] [2022-12-13 14:23:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:23:48,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:23:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:23:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 14:23:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:23:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 14:23:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 14:23:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 14:23:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 14:23:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-12-13 14:23:49,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:23:49,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904124833] [2022-12-13 14:23:49,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904124833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:23:49,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:23:49,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:23:49,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379054448] [2022-12-13 14:23:49,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:23:49,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:23:49,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:23:49,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:23:49,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:23:49,202 INFO L87 Difference]: Start difference. First operand has 186 states, 141 states have (on average 1.4539007092198581) internal successors, (205), 157 states have internal predecessors, (205), 34 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 14:23:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:23:49,389 INFO L93 Difference]: Finished difference Result 367 states and 532 transitions. [2022-12-13 14:23:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:23:49,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 118 [2022-12-13 14:23:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:23:49,399 INFO L225 Difference]: With dead ends: 367 [2022-12-13 14:23:49,399 INFO L226 Difference]: Without dead ends: 170 [2022-12-13 14:23:49,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 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-12-13 14:23:49,407 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 26 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:23:49,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 588 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:23:49,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-13 14:23:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-12-13 14:23:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.3823529411764706) internal successors, (188), 141 states have internal predecessors, (188), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-13 14:23:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 232 transitions. [2022-12-13 14:23:49,451 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 232 transitions. Word has length 118 [2022-12-13 14:23:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:23:49,452 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 232 transitions. [2022-12-13 14:23:49,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 14:23:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 232 transitions. [2022-12-13 14:23:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-13 14:23:49,455 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:23:49,455 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:23:49,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:23:49,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:23:49,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:23:49,456 INFO L85 PathProgramCache]: Analyzing trace with hash -96288345, now seen corresponding path program 1 times [2022-12-13 14:23:49,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:23:49,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201407422] [2022-12-13 14:23:49,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:23:49,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:23:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:23:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 14:23:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:23:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 14:23:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 14:23:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 14:23:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 14:23:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-12-13 14:23:49,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:23:49,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201407422] [2022-12-13 14:23:49,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201407422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:23:49,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:23:49,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:23:49,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743428250] [2022-12-13 14:23:49,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:23:49,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:23:49,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:23:49,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:23:49,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:23:49,819 INFO L87 Difference]: Start difference. First operand 170 states and 232 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 14:23:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:23:50,045 INFO L93 Difference]: Finished difference Result 435 states and 600 transitions. [2022-12-13 14:23:50,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:23:50,046 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), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 118 [2022-12-13 14:23:50,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:23:50,049 INFO L225 Difference]: With dead ends: 435 [2022-12-13 14:23:50,050 INFO L226 Difference]: Without dead ends: 283 [2022-12-13 14:23:50,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-12-13 14:23:50,051 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 204 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:23:50,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 718 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:23:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-12-13 14:23:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 269. [2022-12-13 14:23:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 221 states have (on average 1.420814479638009) internal successors, (314), 226 states have internal predecessors, (314), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-12-13 14:23:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 376 transitions. [2022-12-13 14:23:50,067 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 376 transitions. Word has length 118 [2022-12-13 14:23:50,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:23:50,067 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 376 transitions. [2022-12-13 14:23:50,067 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), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 14:23:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 376 transitions. [2022-12-13 14:23:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-13 14:23:50,069 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:23:50,069 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:23:50,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:23:50,069 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:23:50,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:23:50,069 INFO L85 PathProgramCache]: Analyzing trace with hash -358901924, now seen corresponding path program 1 times [2022-12-13 14:23:50,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:23:50,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172943662] [2022-12-13 14:23:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:23:50,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:23:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:23:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 14:23:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:23:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 14:23:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 14:23:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 14:23:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-12-13 14:23:50,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:23:50,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172943662] [2022-12-13 14:23:50,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172943662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:23:50,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:23:50,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:23:50,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770501879] [2022-12-13 14:23:50,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:23:50,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:23:50,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:23:50,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:23:50,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:23:50,460 INFO L87 Difference]: Start difference. First operand 269 states and 376 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 14:23:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:23:50,701 INFO L93 Difference]: Finished difference Result 730 states and 1030 transitions. [2022-12-13 14:23:50,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:23:50,701 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), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 117 [2022-12-13 14:23:50,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:23:50,705 INFO L225 Difference]: With dead ends: 730 [2022-12-13 14:23:50,705 INFO L226 Difference]: Without dead ends: 479 [2022-12-13 14:23:50,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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-12-13 14:23:50,707 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 193 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:23:50,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 816 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:23:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-12-13 14:23:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 475. [2022-12-13 14:23:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 399 states have (on average 1.4335839598997493) internal successors, (572), 404 states have internal predecessors, (572), 52 states have call successors, (52), 24 states have call predecessors, (52), 23 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-13 14:23:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 670 transitions. [2022-12-13 14:23:50,739 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 670 transitions. Word has length 117 [2022-12-13 14:23:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:23:50,739 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 670 transitions. [2022-12-13 14:23:50,739 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), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 14:23:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 670 transitions. [2022-12-13 14:23:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 14:23:50,742 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:23:50,742 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:23:50,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 14:23:50,742 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:23:50,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:23:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1959898998, now seen corresponding path program 1 times [2022-12-13 14:23:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:23:50,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030527277] [2022-12-13 14:23:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:23:50,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:23:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:23:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 14:23:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:50,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:23:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 14:23:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 14:23:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 14:23:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 14:23:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-12-13 14:23:51,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:23:51,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030527277] [2022-12-13 14:23:51,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030527277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:23:51,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:23:51,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:23:51,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643811007] [2022-12-13 14:23:51,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:23:51,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:23:51,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:23:51,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:23:51,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:23:51,083 INFO L87 Difference]: Start difference. First operand 475 states and 670 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 14:23:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:23:51,216 INFO L93 Difference]: Finished difference Result 477 states and 671 transitions. [2022-12-13 14:23:51,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:23:51,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 137 [2022-12-13 14:23:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:23:51,218 INFO L225 Difference]: With dead ends: 477 [2022-12-13 14:23:51,218 INFO L226 Difference]: Without dead ends: 474 [2022-12-13 14:23:51,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 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-12-13 14:23:51,219 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 201 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:23:51,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 537 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:23:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-12-13 14:23:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-12-13 14:23:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 399 states have (on average 1.431077694235589) internal successors, (571), 403 states have internal predecessors, (571), 51 states have call successors, (51), 24 states have call predecessors, (51), 23 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-13 14:23:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 668 transitions. [2022-12-13 14:23:51,236 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 668 transitions. Word has length 137 [2022-12-13 14:23:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:23:51,237 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 668 transitions. [2022-12-13 14:23:51,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 14:23:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 668 transitions. [2022-12-13 14:23:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-13 14:23:51,238 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:23:51,238 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:23:51,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 14:23:51,238 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:23:51,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:23:51,239 INFO L85 PathProgramCache]: Analyzing trace with hash 627340524, now seen corresponding path program 1 times [2022-12-13 14:23:51,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:23:51,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977969816] [2022-12-13 14:23:51,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:23:51,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:23:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:23:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 14:23:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:23:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 14:23:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 14:23:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 14:23:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 14:23:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-12-13 14:23:51,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:23:51,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977969816] [2022-12-13 14:23:51,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977969816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:23:51,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:23:51,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:23:51,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814616056] [2022-12-13 14:23:51,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:23:51,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:23:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:23:51,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:23:51,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:23:51,551 INFO L87 Difference]: Start difference. First operand 474 states and 668 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 14:23:51,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:23:51,685 INFO L93 Difference]: Finished difference Result 476 states and 669 transitions. [2022-12-13 14:23:51,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:23:51,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 138 [2022-12-13 14:23:51,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:23:51,689 INFO L225 Difference]: With dead ends: 476 [2022-12-13 14:23:51,689 INFO L226 Difference]: Without dead ends: 473 [2022-12-13 14:23:51,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 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-12-13 14:23:51,690 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 218 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:23:51,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 368 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:23:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-12-13 14:23:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2022-12-13 14:23:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 399 states have (on average 1.4285714285714286) internal successors, (570), 402 states have internal predecessors, (570), 50 states have call successors, (50), 24 states have call predecessors, (50), 23 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-13 14:23:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 666 transitions. [2022-12-13 14:23:51,714 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 666 transitions. Word has length 138 [2022-12-13 14:23:51,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:23:51,715 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 666 transitions. [2022-12-13 14:23:51,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 14:23:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 666 transitions. [2022-12-13 14:23:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-13 14:23:51,716 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:23:51,716 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:23:51,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 14:23:51,716 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:23:51,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:23:51,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2027261639, now seen corresponding path program 1 times [2022-12-13 14:23:51,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:23:51,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918624101] [2022-12-13 14:23:51,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:23:51,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:23:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:23:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 14:23:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:23:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 14:23:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 14:23:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 14:23:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 14:23:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-12-13 14:23:51,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:23:51,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918624101] [2022-12-13 14:23:51,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918624101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:23:51,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:23:51,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:23:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913367131] [2022-12-13 14:23:51,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:23:51,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:23:51,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:23:51,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:23:51,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:23:51,980 INFO L87 Difference]: Start difference. First operand 473 states and 666 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 14:23:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:23:52,120 INFO L93 Difference]: Finished difference Result 475 states and 667 transitions. [2022-12-13 14:23:52,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:23:52,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 139 [2022-12-13 14:23:52,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:23:52,123 INFO L225 Difference]: With dead ends: 475 [2022-12-13 14:23:52,123 INFO L226 Difference]: Without dead ends: 472 [2022-12-13 14:23:52,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 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-12-13 14:23:52,125 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 195 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:23:52,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 529 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:23:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-12-13 14:23:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2022-12-13 14:23:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 399 states have (on average 1.4260651629072683) internal successors, (569), 401 states have internal predecessors, (569), 49 states have call successors, (49), 24 states have call predecessors, (49), 23 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-13 14:23:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 664 transitions. [2022-12-13 14:23:52,152 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 664 transitions. Word has length 139 [2022-12-13 14:23:52,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:23:52,152 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 664 transitions. [2022-12-13 14:23:52,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 14:23:52,153 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 664 transitions. [2022-12-13 14:23:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-13 14:23:52,154 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:23:52,154 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:23:52,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 14:23:52,155 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:23:52,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:23:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1579422095, now seen corresponding path program 1 times [2022-12-13 14:23:52,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:23:52,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010296808] [2022-12-13 14:23:52,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:23:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:23:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:23:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 14:23:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:23:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 14:23:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 14:23:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 14:23:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 14:23:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-12-13 14:23:52,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:23:52,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010296808] [2022-12-13 14:23:52,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010296808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:23:52,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:23:52,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:23:52,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424542380] [2022-12-13 14:23:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:23:52,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:23:52,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:23:52,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:23:52,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:23:52,495 INFO L87 Difference]: Start difference. First operand 472 states and 664 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 14:23:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:23:52,703 INFO L93 Difference]: Finished difference Result 1334 states and 1900 transitions. [2022-12-13 14:23:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:23:52,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 140 [2022-12-13 14:23:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:23:52,709 INFO L225 Difference]: With dead ends: 1334 [2022-12-13 14:23:52,709 INFO L226 Difference]: Without dead ends: 886 [2022-12-13 14:23:52,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 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-12-13 14:23:52,711 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 241 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:23:52,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 554 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:23:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-12-13 14:23:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 880. [2022-12-13 14:23:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 751 states have (on average 1.4394141145139814) internal successors, (1081), 753 states have internal predecessors, (1081), 87 states have call successors, (87), 44 states have call predecessors, (87), 41 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2022-12-13 14:23:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1252 transitions. [2022-12-13 14:23:52,759 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1252 transitions. Word has length 140 [2022-12-13 14:23:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:23:52,760 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1252 transitions. [2022-12-13 14:23:52,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 14:23:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1252 transitions. [2022-12-13 14:23:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-13 14:23:52,761 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:23:52,761 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2022-12-13 14:23:52,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 14:23:52,762 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:23:52,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:23:52,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1050241138, now seen corresponding path program 1 times [2022-12-13 14:23:52,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:23:52,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549061833] [2022-12-13 14:23:52,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:23:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:23:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:23:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 14:23:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:23:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 14:23:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 14:23:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:52,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 14:23:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 14:23:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 14:23:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-12-13 14:23:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2022-12-13 14:23:53,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:23:53,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549061833] [2022-12-13 14:23:53,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549061833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:23:53,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:23:53,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:23:53,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912404890] [2022-12-13 14:23:53,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:23:53,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:23:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:23:53,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:23:53,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:23:53,047 INFO L87 Difference]: Start difference. First operand 880 states and 1252 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-12-13 14:23:53,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:23:53,316 INFO L93 Difference]: Finished difference Result 1730 states and 2467 transitions. [2022-12-13 14:23:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 14:23:53,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 159 [2022-12-13 14:23:53,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:23:53,322 INFO L225 Difference]: With dead ends: 1730 [2022-12-13 14:23:53,322 INFO L226 Difference]: Without dead ends: 882 [2022-12-13 14:23:53,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 14:23:53,323 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 238 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:23:53,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1035 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:23:53,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-12-13 14:23:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 877. [2022-12-13 14:23:53,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 749 states have (on average 1.4352469959946594) internal successors, (1075), 751 states have internal predecessors, (1075), 86 states have call successors, (86), 43 states have call predecessors, (86), 41 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2022-12-13 14:23:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1243 transitions. [2022-12-13 14:23:53,350 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1243 transitions. Word has length 159 [2022-12-13 14:23:53,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:23:53,350 INFO L495 AbstractCegarLoop]: Abstraction has 877 states and 1243 transitions. [2022-12-13 14:23:53,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-12-13 14:23:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1243 transitions. [2022-12-13 14:23:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-13 14:23:53,352 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:23:53,352 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:23:53,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 14:23:53,352 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:23:53,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:23:53,353 INFO L85 PathProgramCache]: Analyzing trace with hash 296332059, now seen corresponding path program 1 times [2022-12-13 14:23:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:23:53,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109315568] [2022-12-13 14:23:53,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:23:53,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:23:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:23:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 14:23:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:23:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 14:23:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 14:23:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 14:23:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 14:23:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 14:23:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-12-13 14:23:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2022-12-13 14:23:53,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:23:53,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109315568] [2022-12-13 14:23:53,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109315568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:23:53,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:23:53,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 14:23:53,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971431780] [2022-12-13 14:23:53,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:23:53,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 14:23:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:23:53,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 14:23:53,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:23:53,889 INFO L87 Difference]: Start difference. First operand 877 states and 1243 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 14:23:54,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:23:54,210 INFO L93 Difference]: Finished difference Result 2355 states and 3452 transitions. [2022-12-13 14:23:54,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 14:23:54,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 164 [2022-12-13 14:23:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:23:54,216 INFO L225 Difference]: With dead ends: 2355 [2022-12-13 14:23:54,216 INFO L226 Difference]: Without dead ends: 1510 [2022-12-13 14:23:54,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-13 14:23:54,218 INFO L413 NwaCegarLoop]: 474 mSDtfsCounter, 434 mSDsluCounter, 2590 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:23:54,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 3064 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:23:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2022-12-13 14:23:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 879. [2022-12-13 14:23:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 752 states have (on average 1.4308510638297873) internal successors, (1076), 753 states have internal predecessors, (1076), 85 states have call successors, (85), 43 states have call predecessors, (85), 41 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2022-12-13 14:23:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1243 transitions. [2022-12-13 14:23:54,258 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1243 transitions. Word has length 164 [2022-12-13 14:23:54,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:23:54,258 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1243 transitions. [2022-12-13 14:23:54,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 14:23:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1243 transitions. [2022-12-13 14:23:54,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-13 14:23:54,260 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:23:54,260 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 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] [2022-12-13 14:23:54,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 14:23:54,260 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:23:54,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:23:54,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1563381600, now seen corresponding path program 1 times [2022-12-13 14:23:54,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:23:54,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977660984] [2022-12-13 14:23:54,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:23:54,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:23:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:23:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 14:23:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:23:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 14:23:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 14:23:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 14:23:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 14:23:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:23:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:23:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 14:23:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-12-13 14:23:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-12-13 14:23:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:23:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2022-12-13 14:23:54,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:23:54,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977660984] [2022-12-13 14:23:54,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977660984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:23:54,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:23:54,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 14:23:54,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064625552] [2022-12-13 14:23:54,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:23:54,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:23:54,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:23:54,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:23:54,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:23:54,682 INFO L87 Difference]: Start difference. First operand 879 states and 1243 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 14:23:54,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:23:54,978 INFO L93 Difference]: Finished difference Result 1190 states and 1736 transitions. [2022-12-13 14:23:54,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:23:54,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 171 [2022-12-13 14:23:54,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:23:54,979 INFO L225 Difference]: With dead ends: 1190 [2022-12-13 14:23:54,980 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 14:23:54,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-13 14:23:54,982 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 441 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:23:54,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1300 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:23:54,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 14:23:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 14:23:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:23:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 14:23:54,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 171 [2022-12-13 14:23:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:23:54,983 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 14:23:54,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 14:23:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 14:23:54,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 14:23:54,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 14:23:54,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 14:23:54,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 14:23:56,416 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectFINAL(lines 7015 7017) no Hoare annotation was computed. [2022-12-13 14:23:56,416 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7015 7017) the Hoare annotation is: true [2022-12-13 14:23:56,416 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectEXIT(lines 7015 7017) no Hoare annotation was computed. [2022-12-13 14:23:56,416 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_udevFINAL(lines 6853 6863) no Hoare annotation was computed. [2022-12-13 14:23:56,417 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6853 6863) the Hoare annotation is: (or (not (= |old(~ldv_mutex_udev~0)| 1)) (not (= ~ldv_mutex_lock~0 1)) (not (= ~ldv_mutex_i_mutex_of_inode~0 1)) (not (= 1 ~ldv_mutex_mutex_of_device~0)) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,417 INFO L899 garLoopResultBuilder]: For program point L6856-1(lines 6856 6859) no Hoare annotation was computed. [2022-12-13 14:23:56,417 INFO L899 garLoopResultBuilder]: For program point L6856(lines 6856 6859) no Hoare annotation was computed. [2022-12-13 14:23:56,417 INFO L895 garLoopResultBuilder]: At program point L6857(line 6857) the Hoare annotation is: (or (not (= |old(~ldv_mutex_udev~0)| 1)) (not (= ~ldv_mutex_lock~0 1)) (not (= ~ldv_mutex_i_mutex_of_inode~0 1)) (not (= 1 ~ldv_mutex_mutex_of_device~0))) [2022-12-13 14:23:56,417 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_udevEXIT(lines 6853 6863) no Hoare annotation was computed. [2022-12-13 14:23:56,417 INFO L899 garLoopResultBuilder]: For program point L5762-1(line 5762) no Hoare annotation was computed. [2022-12-13 14:23:56,417 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocFINAL(lines 5757 5767) no Hoare annotation was computed. [2022-12-13 14:23:56,417 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5757 5767) no Hoare annotation was computed. [2022-12-13 14:23:56,418 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 5757 5767) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_mutex_lock~0 1))) (.cse1 (not (= ~ldv_mutex_udev~0 1))) (.cse2 (not (= ~ldv_mutex_i_mutex_of_inode~0 1))) (.cse3 (not (= 1 ~ldv_mutex_mutex_of_device~0))) (.cse4 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_0~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_6~0 0))))) [2022-12-13 14:23:56,418 INFO L899 garLoopResultBuilder]: For program point L5764-1(line 5764) no Hoare annotation was computed. [2022-12-13 14:23:56,418 INFO L895 garLoopResultBuilder]: At program point L5762(line 5762) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_mutex_lock~0 1))) (.cse1 (not (= ~ldv_mutex_udev~0 1))) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (not (= ~ldv_mutex_i_mutex_of_inode~0 1))) (.cse4 (not (= 1 ~ldv_mutex_mutex_of_device~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_6~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_0~0 1))))) [2022-12-13 14:23:56,418 INFO L902 garLoopResultBuilder]: At program point L5764(line 5764) the Hoare annotation is: true [2022-12-13 14:23:56,418 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5720 5722) the Hoare annotation is: true [2022-12-13 14:23:56,418 INFO L899 garLoopResultBuilder]: For program point L5721-2(lines 5720 5722) no Hoare annotation was computed. [2022-12-13 14:23:56,418 INFO L899 garLoopResultBuilder]: For program point L5721(line 5721) no Hoare annotation was computed. [2022-12-13 14:23:56,418 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5720 5722) no Hoare annotation was computed. [2022-12-13 14:23:56,418 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intFINAL(lines 5776 5783) no Hoare annotation was computed. [2022-12-13 14:23:56,418 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5776 5783) the Hoare annotation is: true [2022-12-13 14:23:56,418 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intEXIT(lines 5776 5783) no Hoare annotation was computed. [2022-12-13 14:23:56,418 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6329 6335) no Hoare annotation was computed. [2022-12-13 14:23:56,419 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 6329 6335) the Hoare annotation is: true [2022-12-13 14:23:56,419 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6333) no Hoare annotation was computed. [2022-12-13 14:23:56,419 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6329 6335) no Hoare annotation was computed. [2022-12-13 14:23:56,419 INFO L902 garLoopResultBuilder]: At program point LDV_STOP(lines 5792 5798) the Hoare annotation is: true [2022-12-13 14:23:56,419 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5792 5798) no Hoare annotation was computed. [2022-12-13 14:23:56,419 INFO L899 garLoopResultBuilder]: For program point L6047(lines 6047 6062) no Hoare annotation was computed. [2022-12-13 14:23:56,419 INFO L899 garLoopResultBuilder]: For program point L6080-2(lines 6067 6122) no Hoare annotation was computed. [2022-12-13 14:23:56,419 INFO L899 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2022-12-13 14:23:56,419 INFO L899 garLoopResultBuilder]: For program point L6080(lines 6080 6085) no Hoare annotation was computed. [2022-12-13 14:23:56,419 INFO L895 garLoopResultBuilder]: At program point ldv_mutex_unlock_udev_returnLabel#1(lines 6914 6924) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,419 INFO L895 garLoopResultBuilder]: At program point ldv_initialize_returnLabel#1(lines 6987 6989) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,419 INFO L895 garLoopResultBuilder]: At program point m5632_recover_returnLabel#1(lines 5843 5860) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,420 INFO L899 garLoopResultBuilder]: For program point L6213(line 6213) no Hoare annotation was computed. [2022-12-13 14:23:56,420 INFO L895 garLoopResultBuilder]: At program point L6081(line 6081) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,420 INFO L899 garLoopResultBuilder]: For program point L6081-1(line 6081) no Hoare annotation was computed. [2022-12-13 14:23:56,420 INFO L899 garLoopResultBuilder]: For program point L6973(lines 6964 6982) no Hoare annotation was computed. [2022-12-13 14:23:56,420 INFO L902 garLoopResultBuilder]: At program point L6214(line 6214) the Hoare annotation is: true [2022-12-13 14:23:56,420 INFO L895 garLoopResultBuilder]: At program point L6974(line 6974) the Hoare annotation is: false [2022-12-13 14:23:56,420 INFO L899 garLoopResultBuilder]: For program point L6049(lines 6049 6059) no Hoare annotation was computed. [2022-12-13 14:23:56,420 INFO L899 garLoopResultBuilder]: For program point L6050(line 6050) no Hoare annotation was computed. [2022-12-13 14:23:56,420 INFO L899 garLoopResultBuilder]: For program point L5852(lines 5852 5855) no Hoare annotation was computed. [2022-12-13 14:23:56,423 INFO L895 garLoopResultBuilder]: At program point ldv_usb_unlock_device_udev_returnLabel#1(lines 6955 6961) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,423 INFO L899 garLoopResultBuilder]: For program point L6051(lines 6051 6055) no Hoare annotation was computed. [2022-12-13 14:23:56,423 INFO L895 garLoopResultBuilder]: At program point cdc_subset_driver_exit_returnLabel#1(lines 5956 5962) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,423 INFO L895 garLoopResultBuilder]: At program point __ldv_usb_unlock_device_returnLabel#1(lines 6984 6986) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= 2 ~ldv_mutex_udev~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0)) [2022-12-13 14:23:56,423 INFO L899 garLoopResultBuilder]: For program point L6184(line 6184) no Hoare annotation was computed. [2022-12-13 14:23:56,423 INFO L899 garLoopResultBuilder]: For program point L6052-1(line 6052) no Hoare annotation was computed. [2022-12-13 14:23:56,423 INFO L895 garLoopResultBuilder]: At program point L6052(line 6052) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,424 INFO L902 garLoopResultBuilder]: At program point L6977(lines 6962 6983) the Hoare annotation is: true [2022-12-13 14:23:56,424 INFO L899 garLoopResultBuilder]: For program point L6185(lines 6185 6200) no Hoare annotation was computed. [2022-12-13 14:23:56,424 INFO L895 garLoopResultBuilder]: At program point L6978(line 6978) the Hoare annotation is: false [2022-12-13 14:23:56,424 INFO L899 garLoopResultBuilder]: For program point L6945-1(line 6945) no Hoare annotation was computed. [2022-12-13 14:23:56,424 INFO L895 garLoopResultBuilder]: At program point L6945(line 6945) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,424 INFO L895 garLoopResultBuilder]: At program point L6087(line 6087) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,424 INFO L899 garLoopResultBuilder]: For program point L6087-1(line 6087) no Hoare annotation was computed. [2022-12-13 14:23:56,424 INFO L895 garLoopResultBuilder]: At program point ldv_usb_register_driver_14_returnLabel#1(lines 6307 6320) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,424 INFO L899 garLoopResultBuilder]: For program point L6120(line 6120) no Hoare annotation was computed. [2022-12-13 14:23:56,424 INFO L899 garLoopResultBuilder]: For program point L6946(lines 6946 6952) no Hoare annotation was computed. [2022-12-13 14:23:56,424 INFO L899 garLoopResultBuilder]: For program point L6187(lines 6187 6197) no Hoare annotation was computed. [2022-12-13 14:23:56,424 INFO L899 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2022-12-13 14:23:56,424 INFO L902 garLoopResultBuilder]: At program point L6121(line 6121) the Hoare annotation is: true [2022-12-13 14:23:56,425 INFO L895 garLoopResultBuilder]: At program point ldv_usb_lock_device_for_reset_12_returnLabel#1(lines 6291 6298) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse1 (= ~ldv_mutex_i_mutex_of_inode~0 1)) (.cse2 (= ~ldv_mutex_lock~0 1))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 1) 0) (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 1) 0) (= ~ldv_mutex_udev~0 1)) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) .cse2 (= 2 ~ldv_mutex_udev~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0)))) [2022-12-13 14:23:56,425 INFO L899 garLoopResultBuilder]: For program point L6947-1(line 6947) no Hoare annotation was computed. [2022-12-13 14:23:56,425 INFO L895 garLoopResultBuilder]: At program point L6947(line 6947) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,425 INFO L895 garLoopResultBuilder]: At program point ldv_memset_returnLabel#1(lines 5768 5775) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,425 INFO L902 garLoopResultBuilder]: At program point L6221(line 6221) the Hoare annotation is: true [2022-12-13 14:23:56,425 INFO L899 garLoopResultBuilder]: For program point L6188(line 6188) no Hoare annotation was computed. [2022-12-13 14:23:56,425 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 5979 6229) the Hoare annotation is: true [2022-12-13 14:23:56,425 INFO L899 garLoopResultBuilder]: For program point L6189(lines 6189 6193) no Hoare annotation was computed. [2022-12-13 14:23:56,425 INFO L899 garLoopResultBuilder]: For program point L6057(line 6057) no Hoare annotation was computed. [2022-12-13 14:23:56,425 INFO L895 garLoopResultBuilder]: At program point L6190(line 6190) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,425 INFO L902 garLoopResultBuilder]: At program point L6058(line 6058) the Hoare annotation is: true [2022-12-13 14:23:56,425 INFO L899 garLoopResultBuilder]: For program point L6190-1(line 6190) no Hoare annotation was computed. [2022-12-13 14:23:56,426 INFO L895 garLoopResultBuilder]: At program point L6950(line 6950) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,426 INFO L895 garLoopResultBuilder]: At program point L6025(lines 6002 6228) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,426 INFO L899 garLoopResultBuilder]: For program point L6917-1(lines 6917 6920) no Hoare annotation was computed. [2022-12-13 14:23:56,426 INFO L899 garLoopResultBuilder]: For program point L6950-1(line 6950) no Hoare annotation was computed. [2022-12-13 14:23:56,426 INFO L899 garLoopResultBuilder]: For program point L6917(lines 6917 6920) no Hoare annotation was computed. [2022-12-13 14:23:56,426 INFO L895 garLoopResultBuilder]: At program point usb_register_driver_returnLabel#1(lines 7008 7010) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,426 INFO L895 garLoopResultBuilder]: At program point main_ldv_final#1(lines 6002 6228) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,426 INFO L895 garLoopResultBuilder]: At program point L6918(line 6918) the Hoare annotation is: false [2022-12-13 14:23:56,426 INFO L899 garLoopResultBuilder]: For program point L6159(line 6159) no Hoare annotation was computed. [2022-12-13 14:23:56,426 INFO L899 garLoopResultBuilder]: For program point L6027(lines 6027 6222) no Hoare annotation was computed. [2022-12-13 14:23:56,426 INFO L899 garLoopResultBuilder]: For program point L6093(line 6093) no Hoare annotation was computed. [2022-12-13 14:23:56,426 INFO L895 garLoopResultBuilder]: At program point ldv_reset_resume_1_returnLabel#1(lines 6991 6993) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,426 INFO L899 garLoopResultBuilder]: For program point L6127(line 6127) no Hoare annotation was computed. [2022-12-13 14:23:56,426 INFO L899 garLoopResultBuilder]: For program point L6094(lines 6094 6098) no Hoare annotation was computed. [2022-12-13 14:23:56,427 INFO L902 garLoopResultBuilder]: At program point L6160(line 6160) the Hoare annotation is: true [2022-12-13 14:23:56,427 INFO L899 garLoopResultBuilder]: For program point L6028(line 6028) no Hoare annotation was computed. [2022-12-13 14:23:56,427 INFO L899 garLoopResultBuilder]: For program point L6128(lines 6128 6164) no Hoare annotation was computed. [2022-12-13 14:23:56,427 INFO L899 garLoopResultBuilder]: For program point L6029(lines 6029 6044) no Hoare annotation was computed. [2022-12-13 14:23:56,427 INFO L899 garLoopResultBuilder]: For program point L6195(line 6195) no Hoare annotation was computed. [2022-12-13 14:23:56,427 INFO L895 garLoopResultBuilder]: At program point usbnet_resume_returnLabel#1(lines 7023 7025) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,427 INFO L899 garLoopResultBuilder]: For program point L6130(lines 6130 6161) no Hoare annotation was computed. [2022-12-13 14:23:56,427 INFO L902 garLoopResultBuilder]: At program point L6196(line 6196) the Hoare annotation is: true [2022-12-13 14:23:56,427 INFO L899 garLoopResultBuilder]: For program point L6031(lines 6031 6041) no Hoare annotation was computed. [2022-12-13 14:23:56,427 INFO L899 garLoopResultBuilder]: For program point L6064(line 6064) no Hoare annotation was computed. [2022-12-13 14:23:56,427 INFO L899 garLoopResultBuilder]: For program point L6131(line 6131) no Hoare annotation was computed. [2022-12-13 14:23:56,427 INFO L899 garLoopResultBuilder]: For program point L6065(lines 6065 6125) no Hoare annotation was computed. [2022-12-13 14:23:56,427 INFO L899 garLoopResultBuilder]: For program point L6032(line 6032) no Hoare annotation was computed. [2022-12-13 14:23:56,427 INFO L895 garLoopResultBuilder]: At program point usb_deregister_returnLabel#1(lines 7004 7006) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,427 INFO L895 garLoopResultBuilder]: At program point ldv_usb_deregister_15_returnLabel#1(lines 6321 6328) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point L6132(lines 6132 6137) no Hoare annotation was computed. [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point L6033(lines 6033 6037) no Hoare annotation was computed. [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point L6166(line 6166) no Hoare annotation was computed. [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point L6067(lines 6067 6122) no Hoare annotation was computed. [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point L6100(line 6100) no Hoare annotation was computed. [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point L6167(lines 6167 6182) no Hoare annotation was computed. [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point L6101(lines 6101 6108) no Hoare annotation was computed. [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point L6068(line 6068) no Hoare annotation was computed. [2022-12-13 14:23:56,428 INFO L895 garLoopResultBuilder]: At program point L6003(line 6003) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point L6003-1(line 6003) no Hoare annotation was computed. [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point L6069(lines 6069 6077) no Hoare annotation was computed. [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point L6202(line 6202) no Hoare annotation was computed. [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point L6103(lines 6103 6106) no Hoare annotation was computed. [2022-12-13 14:23:56,428 INFO L899 garLoopResultBuilder]: For program point L6169(lines 6169 6179) no Hoare annotation was computed. [2022-12-13 14:23:56,429 INFO L895 garLoopResultBuilder]: At program point usbnet_suspend_returnLabel#1(lines 7027 7029) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,429 INFO L899 garLoopResultBuilder]: For program point L6203(lines 6203 6218) no Hoare annotation was computed. [2022-12-13 14:23:56,429 INFO L899 garLoopResultBuilder]: For program point L6170(line 6170) no Hoare annotation was computed. [2022-12-13 14:23:56,429 INFO L899 garLoopResultBuilder]: For program point L6071(lines 6071 6075) no Hoare annotation was computed. [2022-12-13 14:23:56,429 INFO L895 garLoopResultBuilder]: At program point L6005(line 6005) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,429 INFO L899 garLoopResultBuilder]: For program point L6005-1(line 6005) no Hoare annotation was computed. [2022-12-13 14:23:56,429 INFO L895 garLoopResultBuilder]: At program point usbnet_probe_returnLabel#1(lines 7019 7021) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,429 INFO L899 garLoopResultBuilder]: For program point L6171(lines 6171 6175) no Hoare annotation was computed. [2022-12-13 14:23:56,429 INFO L899 garLoopResultBuilder]: For program point L6039(line 6039) no Hoare annotation was computed. [2022-12-13 14:23:56,429 INFO L899 garLoopResultBuilder]: For program point L6139(line 6139) no Hoare annotation was computed. [2022-12-13 14:23:56,429 INFO L899 garLoopResultBuilder]: For program point L6172-1(line 6172) no Hoare annotation was computed. [2022-12-13 14:23:56,429 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 14:23:56,429 INFO L899 garLoopResultBuilder]: For program point L6205(lines 6205 6215) no Hoare annotation was computed. [2022-12-13 14:23:56,429 INFO L895 garLoopResultBuilder]: At program point L6172(line 6172) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,430 INFO L895 garLoopResultBuilder]: At program point L6007(line 6007) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,430 INFO L899 garLoopResultBuilder]: For program point L6007-1(line 6007) no Hoare annotation was computed. [2022-12-13 14:23:56,430 INFO L895 garLoopResultBuilder]: At program point L5974(line 5974) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,430 INFO L902 garLoopResultBuilder]: At program point L6040(line 6040) the Hoare annotation is: true [2022-12-13 14:23:56,430 INFO L899 garLoopResultBuilder]: For program point L5974-1(line 5974) no Hoare annotation was computed. [2022-12-13 14:23:56,430 INFO L899 garLoopResultBuilder]: For program point L6965-1(lines 6964 6982) no Hoare annotation was computed. [2022-12-13 14:23:56,430 INFO L899 garLoopResultBuilder]: For program point L6965(lines 6965 6968) no Hoare annotation was computed. [2022-12-13 14:23:56,430 INFO L895 garLoopResultBuilder]: At program point ldv_usb_driver_1_returnLabel#1(lines 5970 5978) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,430 INFO L899 garLoopResultBuilder]: For program point L6206(line 6206) no Hoare annotation was computed. [2022-12-13 14:23:56,430 INFO L899 garLoopResultBuilder]: For program point L6140(lines 6140 6157) no Hoare annotation was computed. [2022-12-13 14:23:56,430 INFO L895 garLoopResultBuilder]: At program point L6966(line 6966) the Hoare annotation is: false [2022-12-13 14:23:56,430 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 14:23:56,430 INFO L899 garLoopResultBuilder]: For program point L6207(lines 6207 6211) no Hoare annotation was computed. [2022-12-13 14:23:56,430 INFO L895 garLoopResultBuilder]: At program point cdc_subset_driver_init_returnLabel#1(lines 5948 5955) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,431 INFO L895 garLoopResultBuilder]: At program point L6009(line 6009) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,431 INFO L899 garLoopResultBuilder]: For program point L6009-1(line 6009) no Hoare annotation was computed. [2022-12-13 14:23:56,431 INFO L899 garLoopResultBuilder]: For program point L6208-1(line 6208) no Hoare annotation was computed. [2022-12-13 14:23:56,431 INFO L899 garLoopResultBuilder]: For program point L6142(lines 6142 6150) no Hoare annotation was computed. [2022-12-13 14:23:56,431 INFO L895 garLoopResultBuilder]: At program point L6208(line 6208) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,431 INFO L899 garLoopResultBuilder]: For program point L6142-2(lines 6140 6156) no Hoare annotation was computed. [2022-12-13 14:23:56,431 INFO L895 garLoopResultBuilder]: At program point ldv_usb_lock_device_for_reset_udev_returnLabel#1(lines 6940 6954) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse1 (= ~ldv_mutex_i_mutex_of_inode~0 1)) (.cse2 (= ~ldv_mutex_lock~0 1))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) .cse2 (= 2 ~ldv_mutex_udev~0)) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 1) 0) (= ~ldv_mutex_udev~0 1)))) [2022-12-13 14:23:56,431 INFO L899 garLoopResultBuilder]: For program point L6110(line 6110) no Hoare annotation was computed. [2022-12-13 14:23:56,431 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 14:23:56,431 INFO L895 garLoopResultBuilder]: At program point L6011(line 6011) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,431 INFO L895 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,431 INFO L899 garLoopResultBuilder]: For program point L6011-1(line 6011) no Hoare annotation was computed. [2022-12-13 14:23:56,431 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-12-13 14:23:56,432 INFO L899 garLoopResultBuilder]: For program point L6969(lines 6964 6982) no Hoare annotation was computed. [2022-12-13 14:23:56,432 INFO L899 garLoopResultBuilder]: For program point L6111(lines 6111 6118) no Hoare annotation was computed. [2022-12-13 14:23:56,432 INFO L899 garLoopResultBuilder]: For program point L6177(line 6177) no Hoare annotation was computed. [2022-12-13 14:23:56,432 INFO L895 garLoopResultBuilder]: At program point L6970(line 6970) the Hoare annotation is: false [2022-12-13 14:23:56,432 INFO L895 garLoopResultBuilder]: At program point usb_reset_device_returnLabel#1(lines 7012 7014) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= 2 ~ldv_mutex_udev~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0)) [2022-12-13 14:23:56,432 INFO L902 garLoopResultBuilder]: At program point L6178(line 6178) the Hoare annotation is: true [2022-12-13 14:23:56,432 INFO L895 garLoopResultBuilder]: At program point ldv___ldv_usb_unlock_device_13_returnLabel#1(lines 6299 6306) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,432 INFO L899 garLoopResultBuilder]: For program point L6079(line 6079) no Hoare annotation was computed. [2022-12-13 14:23:56,432 INFO L899 garLoopResultBuilder]: For program point L6046(line 6046) no Hoare annotation was computed. [2022-12-13 14:23:56,432 INFO L895 garLoopResultBuilder]: At program point L6013(line 6013) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-12-13 14:23:56,432 INFO L899 garLoopResultBuilder]: For program point L6013-1(line 6013) no Hoare annotation was computed. [2022-12-13 14:23:56,432 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-12-13 14:23:56,432 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_mutex_lock~0 1))) (.cse1 (not (= ~ldv_mutex_udev~0 1))) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (not (= ~ldv_mutex_i_mutex_of_inode~0 1))) (.cse4 (not (= 1 ~ldv_mutex_mutex_of_device~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_6~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_0~0 1))))) [2022-12-13 14:23:56,432 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-12-13 14:23:56,433 INFO L899 garLoopResultBuilder]: For program point always_connectedFINAL(lines 5837 5842) no Hoare annotation was computed. [2022-12-13 14:23:56,433 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5837 5842) the Hoare annotation is: true [2022-12-13 14:23:56,433 INFO L899 garLoopResultBuilder]: For program point always_connectedEXIT(lines 5837 5842) no Hoare annotation was computed. [2022-12-13 14:23:56,433 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6336 6349) the Hoare annotation is: true [2022-12-13 14:23:56,433 INFO L899 garLoopResultBuilder]: For program point L6343-1(lines 6343 6346) no Hoare annotation was computed. [2022-12-13 14:23:56,433 INFO L899 garLoopResultBuilder]: For program point L6343(lines 6343 6346) no Hoare annotation was computed. [2022-12-13 14:23:56,433 INFO L902 garLoopResultBuilder]: At program point L6344(line 6344) the Hoare annotation is: true [2022-12-13 14:23:56,433 INFO L899 garLoopResultBuilder]: For program point ldv_undef_int_negativeFINAL(lines 6336 6349) no Hoare annotation was computed. [2022-12-13 14:23:56,433 INFO L899 garLoopResultBuilder]: For program point L6341-1(line 6341) no Hoare annotation was computed. [2022-12-13 14:23:56,433 INFO L899 garLoopResultBuilder]: For program point ldv_undef_int_negativeEXIT(lines 6336 6349) no Hoare annotation was computed. [2022-12-13 14:23:56,433 INFO L902 garLoopResultBuilder]: At program point L6341(line 6341) the Hoare annotation is: true [2022-12-13 14:23:56,435 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:23:56,437 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 14:23:56,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:23:56 BoogieIcfgContainer [2022-12-13 14:23:56,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 14:23:56,450 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:23:56,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:23:56,450 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:23:56,450 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:23:48" (3/4) ... [2022-12-13 14:23:56,452 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 14:23:56,457 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usbnet_disconnect [2022-12-13 14:23:56,457 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-12-13 14:23:56,457 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_udev [2022-12-13 14:23:56,457 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-12-13 14:23:56,458 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2022-12-13 14:23:56,458 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-12-13 14:23:56,458 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2022-12-13 14:23:56,458 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2022-12-13 14:23:56,458 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure always_connected [2022-12-13 14:23:56,458 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int_negative [2022-12-13 14:23:56,471 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2022-12-13 14:23:56,472 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-12-13 14:23:56,473 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 14:23:56,474 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 14:23:56,474 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 14:23:56,496 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 [2022-12-13 14:23:56,496 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 [2022-12-13 14:23:56,496 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) || ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && ldv_mutex_udev == 1) [2022-12-13 14:23:56,496 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 [2022-12-13 14:23:56,496 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ldv_mutex_udev == 1) || (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) [2022-12-13 14:23:56,497 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0 [2022-12-13 14:23:56,498 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0 [2022-12-13 14:23:56,594 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 14:23:56,595 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:23:56,595 INFO L158 Benchmark]: Toolchain (without parser) took 10230.21ms. Allocated memory was 172.0MB in the beginning and 360.7MB in the end (delta: 188.7MB). Free memory was 125.6MB in the beginning and 255.1MB in the end (delta: -129.5MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2022-12-13 14:23:56,595 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:23:56,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1087.20ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 125.6MB in the beginning and 122.2MB in the end (delta: 3.3MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. [2022-12-13 14:23:56,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.26ms. Allocated memory is still 207.6MB. Free memory was 122.2MB in the beginning and 113.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 14:23:56,596 INFO L158 Benchmark]: Boogie Preprocessor took 67.91ms. Allocated memory is still 207.6MB. Free memory was 113.8MB in the beginning and 104.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 14:23:56,596 INFO L158 Benchmark]: RCFGBuilder took 893.34ms. Allocated memory is still 207.6MB. Free memory was 104.4MB in the beginning and 109.7MB in the end (delta: -5.3MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. [2022-12-13 14:23:56,596 INFO L158 Benchmark]: TraceAbstraction took 7955.54ms. Allocated memory was 207.6MB in the beginning and 360.7MB in the end (delta: 153.1MB). Free memory was 108.7MB in the beginning and 286.5MB in the end (delta: -177.8MB). Peak memory consumption was 177.7MB. Max. memory is 16.1GB. [2022-12-13 14:23:56,596 INFO L158 Benchmark]: Witness Printer took 144.72ms. Allocated memory is still 360.7MB. Free memory was 286.5MB in the beginning and 255.1MB in the end (delta: 31.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 14:23:56,597 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1087.20ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 125.6MB in the beginning and 122.2MB in the end (delta: 3.3MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.26ms. Allocated memory is still 207.6MB. Free memory was 122.2MB in the beginning and 113.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.91ms. Allocated memory is still 207.6MB. Free memory was 113.8MB in the beginning and 104.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 893.34ms. Allocated memory is still 207.6MB. Free memory was 104.4MB in the beginning and 109.7MB in the end (delta: -5.3MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7955.54ms. Allocated memory was 207.6MB in the beginning and 360.7MB in the end (delta: 153.1MB). Free memory was 108.7MB in the beginning and 286.5MB in the end (delta: -177.8MB). Peak memory consumption was 177.7MB. Max. memory is 16.1GB. * Witness Printer took 144.72ms. Allocated memory is still 360.7MB. Free memory was 286.5MB in the beginning and 255.1MB in the end (delta: 31.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 187 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2470 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2391 mSDsluCounter, 9509 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6892 mSDsCounter, 414 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1400 IncrementalHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 414 mSolverCounterUnsat, 2617 mSDtfsCounter, 1400 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=880occurred in iteration=7, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 660 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 567 PreInvPairs, 725 NumberOfFragments, 882 HoareAnnotationTreeSize, 567 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 70 FomulaSimplificationsInter, 7028 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1401 NumberOfCodeBlocks, 1401 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1391 ConstructedInterpolants, 0 QuantifiedInterpolants, 2506 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 2713/2713 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5956]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 7023]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6002]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6002]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5843]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6940]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) || ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && ldv_mutex_udev == 1) - InvariantResult [Line: 6321]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6307]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5768]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 6914]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 6991]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6984]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0 - InvariantResult [Line: 7019]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5792]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7027]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5970]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6962]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6291]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ldv_mutex_udev == 1) || (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) - InvariantResult [Line: 7004]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6299]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 7008]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 5979]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6955]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 7012]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0 - InvariantResult [Line: 5948]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6987]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 RESULT: Ultimate proved your program to be correct! [2022-12-13 14:23:56,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_015e2399-f28d-47da-8237-5a4d774073c4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE