./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows 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_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/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_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 88f19b088f98626e870666f9633d9e7e34156d2b7ba315c9b1bc3979a22f8d34 --- 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 12:19:02,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:19:02,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:19:02,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:19:02,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:19:02,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:19:02,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:19:02,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:19:02,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:19:02,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:19:02,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:19:02,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:19:02,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:19:02,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:19:02,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:19:02,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:19:02,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:19:02,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:19:02,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:19:02,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:19:02,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:19:02,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:19:02,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:19:02,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:19:02,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:19:02,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:19:02,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:19:02,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:19:02,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:19:02,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:19:02,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:19:02,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:19:02,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:19:02,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:19:02,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:19:02,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:19:02,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:19:02,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:19:02,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:19:02,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:19:02,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:19:02,926 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-12-13 12:19:02,940 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:19:02,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:19:02,940 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:19:02,940 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:19:02,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:19:02,941 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:19:02,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:19:02,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:19:02,942 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:19:02,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:19:02,942 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:19:02,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:19:02,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:19:02,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:19:02,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:19:02,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:19:02,943 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 12:19:02,943 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:19:02,944 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:19:02,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:19:02,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:19:02,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:19:02,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:19:02,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:19:02,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:19:02,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:19:02,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:19:02,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:19:02,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:19:02,945 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:19:02,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:19:02,946 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:19:02,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:19:02,946 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:19:02,946 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_c9f5a4cf-c239-4542-96ed-031cc844a94f/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_c9f5a4cf-c239-4542-96ed-031cc844a94f/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 ! overflow) ) 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 -> 88f19b088f98626e870666f9633d9e7e34156d2b7ba315c9b1bc3979a22f8d34 [2022-12-13 12:19:03,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:19:03,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:19:03,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:19:03,141 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:19:03,142 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:19:03,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 12:19:05,818 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:19:06,086 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:19:06,086 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 12:19:06,099 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/data/a0885c0d2/4f3677076a28400a8af6159779e2d1c2/FLAGd0f1e119b [2022-12-13 12:19:06,113 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/data/a0885c0d2/4f3677076a28400a8af6159779e2d1c2 [2022-12-13 12:19:06,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:19:06,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:19:06,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:19:06,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:19:06,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:19:06,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:19:06" (1/1) ... [2022-12-13 12:19:06,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e00bda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06, skipping insertion in model container [2022-12-13 12:19:06,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:19:06" (1/1) ... [2022-12-13 12:19:06,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:19:06,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:19:06,403 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 12:19:06,405 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 12:19:06,409 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_interruptible_nested [2022-12-13 12:19:06,410 WARN L623 FunctionHandler]: Unknown extern function dev_printk [2022-12-13 12:19:06,411 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_read [2022-12-13 12:19:06,412 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 12:19:06,423 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,426 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 12:19:06,426 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,427 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 12:19:06,428 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 12:19:06,430 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,431 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,432 WARN L623 FunctionHandler]: Unknown extern function __mutex_init [2022-12-13 12:19:06,432 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_register [2022-12-13 12:19:06,433 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,434 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_register [2022-12-13 12:19:06,434 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,436 WARN L623 FunctionHandler]: Unknown extern function dev_warn [2022-12-13 12:19:06,436 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,437 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,440 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_unregister [2022-12-13 12:19:06,441 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_release [2022-12-13 12:19:06,441 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 12:19:06,444 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_unregister [2022-12-13 12:19:06,444 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_release [2022-12-13 12:19:06,446 WARN L623 FunctionHandler]: Unknown extern function platform_driver_register [2022-12-13 12:19:06,448 WARN L623 FunctionHandler]: Unknown extern function platform_driver_unregister [2022-12-13 12:19:06,458 WARN L623 FunctionHandler]: Unknown extern function ldv_check_final_state [2022-12-13 12:19:06,461 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_c9f5a4cf-c239-4542-96ed-031cc844a94f/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i[37767,37780] [2022-12-13 12:19:06,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:19:06,481 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:19:06,509 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 12:19:06,510 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 12:19:06,510 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_interruptible_nested [2022-12-13 12:19:06,511 WARN L623 FunctionHandler]: Unknown extern function dev_printk [2022-12-13 12:19:06,511 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_read [2022-12-13 12:19:06,512 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 12:19:06,519 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,523 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 12:19:06,523 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,524 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 12:19:06,524 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 12:19:06,526 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,527 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,527 WARN L623 FunctionHandler]: Unknown extern function __mutex_init [2022-12-13 12:19:06,528 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_register [2022-12-13 12:19:06,529 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,530 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_register [2022-12-13 12:19:06,530 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,532 WARN L623 FunctionHandler]: Unknown extern function dev_warn [2022-12-13 12:19:06,532 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,533 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 12:19:06,534 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_unregister [2022-12-13 12:19:06,535 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_release [2022-12-13 12:19:06,535 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 12:19:06,537 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_unregister [2022-12-13 12:19:06,537 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_release [2022-12-13 12:19:06,538 WARN L623 FunctionHandler]: Unknown extern function platform_driver_register [2022-12-13 12:19:06,539 WARN L623 FunctionHandler]: Unknown extern function platform_driver_unregister [2022-12-13 12:19:06,544 WARN L623 FunctionHandler]: Unknown extern function ldv_check_final_state [2022-12-13 12:19:06,546 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_c9f5a4cf-c239-4542-96ed-031cc844a94f/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i[37767,37780] [2022-12-13 12:19:06,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:19:06,569 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:19:06,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06 WrapperNode [2022-12-13 12:19:06,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:19:06,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:19:06,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:19:06,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:19:06,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06" (1/1) ... [2022-12-13 12:19:06,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06" (1/1) ... [2022-12-13 12:19:06,616 INFO L138 Inliner]: procedures = 83, calls = 168, calls flagged for inlining = 31, calls inlined = 25, statements flattened = 527 [2022-12-13 12:19:06,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:19:06,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:19:06,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:19:06,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:19:06,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06" (1/1) ... [2022-12-13 12:19:06,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06" (1/1) ... [2022-12-13 12:19:06,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06" (1/1) ... [2022-12-13 12:19:06,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06" (1/1) ... [2022-12-13 12:19:06,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06" (1/1) ... [2022-12-13 12:19:06,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06" (1/1) ... [2022-12-13 12:19:06,660 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06" (1/1) ... [2022-12-13 12:19:06,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06" (1/1) ... [2022-12-13 12:19:06,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:19:06,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:19:06,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:19:06,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:19:06,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06" (1/1) ... [2022-12-13 12:19:06,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:19:06,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:06,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:19:06,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:19:06,733 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2022-12-13 12:19:06,733 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2022-12-13 12:19:06,733 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_probe [2022-12-13 12:19:06,733 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_probe [2022-12-13 12:19:06,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:19:06,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-12-13 12:19:06,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-12-13 12:19:06,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:19:06,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 12:19:06,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-12-13 12:19:06,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-12-13 12:19:06,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:19:06,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-12-13 12:19:06,734 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-12-13 12:19:06,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 12:19:06,735 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-12-13 12:19:06,735 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-12-13 12:19:06,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-12-13 12:19:06,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-12-13 12:19:06,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-13 12:19:06,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-13 12:19:06,735 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2022-12-13 12:19:06,735 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2022-12-13 12:19:06,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:19:06,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 12:19:06,736 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-12-13 12:19:06,736 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-12-13 12:19:06,736 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2022-12-13 12:19:06,736 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2022-12-13 12:19:06,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:19:06,736 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2022-12-13 12:19:06,736 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2022-12-13 12:19:06,736 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 12:19:06,736 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 12:19:06,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:19:06,737 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove [2022-12-13 12:19:06,737 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove [2022-12-13 12:19:06,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 12:19:06,737 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-12-13 12:19:06,737 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-12-13 12:19:06,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:19:06,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:19:06,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2022-12-13 12:19:06,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2022-12-13 12:19:06,738 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-12-13 12:19:06,738 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-12-13 12:19:06,897 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:19:06,899 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:19:07,181 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-12-13 12:19:07,354 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:19:07,360 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:19:07,361 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 12:19:07,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:19:07 BoogieIcfgContainer [2022-12-13 12:19:07,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:19:07,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:19:07,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:19:07,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:19:07,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:19:06" (1/3) ... [2022-12-13 12:19:07,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462e9663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:19:07, skipping insertion in model container [2022-12-13 12:19:07,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:19:06" (2/3) ... [2022-12-13 12:19:07,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462e9663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:19:07, skipping insertion in model container [2022-12-13 12:19:07,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:19:07" (3/3) ... [2022-12-13 12:19:07,370 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 12:19:07,384 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:19:07,384 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-12-13 12:19:07,425 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:19:07,429 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;@7fe68e61, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:19:07,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 12:19:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 236 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 184 states have internal predecessors, (223), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-12-13 12:19:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 12:19:07,439 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:07,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:19:07,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash 165870401, now seen corresponding path program 1 times [2022-12-13 12:19:07,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:07,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185507751] [2022-12-13 12:19:07,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:07,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:07,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 12:19:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:19:07,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:07,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185507751] [2022-12-13 12:19:07,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185507751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:07,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:07,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:19:07,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248918444] [2022-12-13 12:19:07,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:07,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:19:07,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:07,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:19:07,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:19:07,711 INFO L87 Difference]: Start difference. First operand has 236 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 184 states have internal predecessors, (223), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 12:19:08,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:08,164 INFO L93 Difference]: Finished difference Result 518 states and 680 transitions. [2022-12-13 12:19:08,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:19:08,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-12-13 12:19:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:08,176 INFO L225 Difference]: With dead ends: 518 [2022-12-13 12:19:08,177 INFO L226 Difference]: Without dead ends: 262 [2022-12-13 12:19:08,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:19:08,184 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 95 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:08,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 532 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 12:19:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-12-13 12:19:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 239. [2022-12-13 12:19:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 171 states have (on average 1.345029239766082) internal successors, (230), 187 states have internal predecessors, (230), 36 states have call successors, (36), 16 states have call predecessors, (36), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-12-13 12:19:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 302 transitions. [2022-12-13 12:19:08,245 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 302 transitions. Word has length 16 [2022-12-13 12:19:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:08,245 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 302 transitions. [2022-12-13 12:19:08,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 12:19:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 302 transitions. [2022-12-13 12:19:08,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 12:19:08,248 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:08,248 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:19:08,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:19:08,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:08,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:08,249 INFO L85 PathProgramCache]: Analyzing trace with hash -11803947, now seen corresponding path program 1 times [2022-12-13 12:19:08,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:08,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649683015] [2022-12-13 12:19:08,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:08,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:08,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:08,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:08,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 12:19:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 12:19:08,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:08,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649683015] [2022-12-13 12:19:08,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649683015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:08,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:08,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:19:08,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180303725] [2022-12-13 12:19:08,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:08,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:19:08,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:08,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:19:08,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:19:08,419 INFO L87 Difference]: Start difference. First operand 239 states and 302 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 12:19:09,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:09,076 INFO L93 Difference]: Finished difference Result 521 states and 667 transitions. [2022-12-13 12:19:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:19:09,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-12-13 12:19:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:09,080 INFO L225 Difference]: With dead ends: 521 [2022-12-13 12:19:09,081 INFO L226 Difference]: Without dead ends: 515 [2022-12-13 12:19:09,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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 12:19:09,082 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 324 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:09,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 688 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 12:19:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-12-13 12:19:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 459. [2022-12-13 12:19:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 339 states have (on average 1.3303834808259587) internal successors, (451), 356 states have internal predecessors, (451), 72 states have call successors, (72), 32 states have call predecessors, (72), 32 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-12-13 12:19:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 595 transitions. [2022-12-13 12:19:09,117 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 595 transitions. Word has length 40 [2022-12-13 12:19:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:09,117 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 595 transitions. [2022-12-13 12:19:09,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 12:19:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 595 transitions. [2022-12-13 12:19:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 12:19:09,119 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:09,119 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:19:09,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:19:09,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:09,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:09,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2035530627, now seen corresponding path program 1 times [2022-12-13 12:19:09,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:09,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976673713] [2022-12-13 12:19:09,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:09,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:09,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:09,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 12:19:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 12:19:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 12:19:09,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:09,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976673713] [2022-12-13 12:19:09,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976673713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:09,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:09,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:19:09,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495548937] [2022-12-13 12:19:09,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:09,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:19:09,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:09,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:19:09,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:19:09,234 INFO L87 Difference]: Start difference. First operand 459 states and 595 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 12:19:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:09,759 INFO L93 Difference]: Finished difference Result 1167 states and 1505 transitions. [2022-12-13 12:19:09,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:19:09,759 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), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-12-13 12:19:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:09,764 INFO L225 Difference]: With dead ends: 1167 [2022-12-13 12:19:09,764 INFO L226 Difference]: Without dead ends: 711 [2022-12-13 12:19:09,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:19:09,766 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 185 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:09,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 729 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 12:19:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-12-13 12:19:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 625. [2022-12-13 12:19:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 459 states have (on average 1.3050108932461875) internal successors, (599), 476 states have internal predecessors, (599), 96 states have call successors, (96), 54 states have call predecessors, (96), 54 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2022-12-13 12:19:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 791 transitions. [2022-12-13 12:19:09,812 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 791 transitions. Word has length 54 [2022-12-13 12:19:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:09,812 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 791 transitions. [2022-12-13 12:19:09,812 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), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 12:19:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 791 transitions. [2022-12-13 12:19:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 12:19:09,815 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:09,815 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:09,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:19:09,816 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash 622072863, now seen corresponding path program 1 times [2022-12-13 12:19:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:09,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582515365] [2022-12-13 12:19:09,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:09,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:09,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:09,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 12:19:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:09,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:09,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 12:19:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:09,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 12:19:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:09,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:10,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 12:19:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 12:19:10,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:10,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582515365] [2022-12-13 12:19:10,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582515365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:10,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296545380] [2022-12-13 12:19:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:10,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:10,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:10,009 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:10,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 12:19:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:10,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 12:19:10,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 12:19:10,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:10,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296545380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:10,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:10,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 12:19:10,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488174929] [2022-12-13 12:19:10,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:10,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:19:10,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:10,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:19:10,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:19:10,203 INFO L87 Difference]: Start difference. First operand 625 states and 791 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 12:19:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:10,257 INFO L93 Difference]: Finished difference Result 1332 states and 1692 transitions. [2022-12-13 12:19:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:19:10,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2022-12-13 12:19:10,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:10,260 INFO L225 Difference]: With dead ends: 1332 [2022-12-13 12:19:10,261 INFO L226 Difference]: Without dead ends: 710 [2022-12-13 12:19:10,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:19:10,262 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 198 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:10,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 584 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:19:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-12-13 12:19:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 698. [2022-12-13 12:19:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 523 states have (on average 1.315487571701721) internal successors, (688), 541 states have internal predecessors, (688), 104 states have call successors, (104), 55 states have call predecessors, (104), 55 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2022-12-13 12:19:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 896 transitions. [2022-12-13 12:19:10,288 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 896 transitions. Word has length 66 [2022-12-13 12:19:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:10,288 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 896 transitions. [2022-12-13 12:19:10,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 12:19:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 896 transitions. [2022-12-13 12:19:10,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-13 12:19:10,290 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:10,290 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:19:10,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:19:10,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:10,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1434225425, now seen corresponding path program 1 times [2022-12-13 12:19:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:10,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253684262] [2022-12-13 12:19:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:10,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:10,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:10,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 12:19:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:10,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 12:19:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:10,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:10,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 12:19:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:10,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 12:19:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:10,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:10,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 12:19:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 12:19:10,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:10,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253684262] [2022-12-13 12:19:10,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253684262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:10,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:10,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:19:10,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771651674] [2022-12-13 12:19:10,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:10,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:19:10,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:10,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:19:10,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:19:10,659 INFO L87 Difference]: Start difference. First operand 698 states and 896 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 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 12:19:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:10,970 INFO L93 Difference]: Finished difference Result 1270 states and 1646 transitions. [2022-12-13 12:19:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:19:10,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 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 81 [2022-12-13 12:19:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:10,977 INFO L225 Difference]: With dead ends: 1270 [2022-12-13 12:19:10,977 INFO L226 Difference]: Without dead ends: 764 [2022-12-13 12:19:10,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:19:10,980 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 124 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:10,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 524 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:19:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-12-13 12:19:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 706. [2022-12-13 12:19:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 529 states have (on average 1.3119092627599245) internal successors, (694), 547 states have internal predecessors, (694), 106 states have call successors, (106), 55 states have call predecessors, (106), 55 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2022-12-13 12:19:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 906 transitions. [2022-12-13 12:19:11,029 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 906 transitions. Word has length 81 [2022-12-13 12:19:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:11,030 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 906 transitions. [2022-12-13 12:19:11,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 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 12:19:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 906 transitions. [2022-12-13 12:19:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 12:19:11,034 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:11,034 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:11,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:19:11,035 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:11,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:11,035 INFO L85 PathProgramCache]: Analyzing trace with hash -21740282, now seen corresponding path program 1 times [2022-12-13 12:19:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:11,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477665211] [2022-12-13 12:19:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:11,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 12:19:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 12:19:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 12:19:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 12:19:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 12:19:11,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:11,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477665211] [2022-12-13 12:19:11,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477665211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:11,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:11,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:19:11,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229791466] [2022-12-13 12:19:11,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:11,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:19:11,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:11,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:19:11,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:19:11,167 INFO L87 Difference]: Start difference. First operand 706 states and 906 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 12:19:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:11,413 INFO L93 Difference]: Finished difference Result 1539 states and 2014 transitions. [2022-12-13 12:19:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:19:11,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2022-12-13 12:19:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:11,418 INFO L225 Difference]: With dead ends: 1539 [2022-12-13 12:19:11,418 INFO L226 Difference]: Without dead ends: 836 [2022-12-13 12:19:11,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:19:11,420 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 91 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:11,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 548 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:19:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-12-13 12:19:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 784. [2022-12-13 12:19:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 598 states have (on average 1.3210702341137124) internal successors, (790), 616 states have internal predecessors, (790), 115 states have call successors, (115), 55 states have call predecessors, (115), 55 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-12-13 12:19:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1020 transitions. [2022-12-13 12:19:11,469 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1020 transitions. Word has length 84 [2022-12-13 12:19:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:11,470 INFO L495 AbstractCegarLoop]: Abstraction has 784 states and 1020 transitions. [2022-12-13 12:19:11,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 12:19:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1020 transitions. [2022-12-13 12:19:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-13 12:19:11,472 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:11,472 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 12:19:11,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:19:11,472 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:11,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1302579183, now seen corresponding path program 2 times [2022-12-13 12:19:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:11,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920175512] [2022-12-13 12:19:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 12:19:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 12:19:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-12-13 12:19:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 12:19:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 12:19:11,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:11,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920175512] [2022-12-13 12:19:11,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920175512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:11,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:11,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:19:11,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906989607] [2022-12-13 12:19:11,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:11,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:19:11,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:11,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:19:11,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:19:11,601 INFO L87 Difference]: Start difference. First operand 784 states and 1020 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 12:19:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:11,940 INFO L93 Difference]: Finished difference Result 1345 states and 1748 transitions. [2022-12-13 12:19:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:19:11,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 78 [2022-12-13 12:19:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:11,945 INFO L225 Difference]: With dead ends: 1345 [2022-12-13 12:19:11,945 INFO L226 Difference]: Without dead ends: 538 [2022-12-13 12:19:11,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:19:11,949 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 279 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:11,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 512 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 12:19:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-12-13 12:19:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 505. [2022-12-13 12:19:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 378 states have (on average 1.2936507936507937) internal successors, (489), 393 states have internal predecessors, (489), 74 states have call successors, (74), 39 states have call predecessors, (74), 39 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2022-12-13 12:19:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 637 transitions. [2022-12-13 12:19:11,984 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 637 transitions. Word has length 78 [2022-12-13 12:19:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:11,984 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 637 transitions. [2022-12-13 12:19:11,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 12:19:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 637 transitions. [2022-12-13 12:19:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-13 12:19:11,986 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:11,987 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:19:11,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:19:11,987 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:11,987 INFO L85 PathProgramCache]: Analyzing trace with hash -456742297, now seen corresponding path program 1 times [2022-12-13 12:19:11,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:11,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646680902] [2022-12-13 12:19:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:11,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 12:19:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 12:19:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 12:19:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 12:19:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 12:19:12,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:12,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646680902] [2022-12-13 12:19:12,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646680902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:12,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252623509] [2022-12-13 12:19:12,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:12,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:12,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:12,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:12,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 12:19:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:19:12,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 12:19:12,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:12,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252623509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:12,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:12,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-13 12:19:12,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130773339] [2022-12-13 12:19:12,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:12,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:19:12,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:12,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:19:12,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:19:12,314 INFO L87 Difference]: Start difference. First operand 505 states and 637 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 12:19:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:12,383 INFO L93 Difference]: Finished difference Result 988 states and 1250 transitions. [2022-12-13 12:19:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:19:12,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2022-12-13 12:19:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:12,386 INFO L225 Difference]: With dead ends: 988 [2022-12-13 12:19:12,386 INFO L226 Difference]: Without dead ends: 508 [2022-12-13 12:19:12,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:19:12,388 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 58 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:12,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 754 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:19:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-12-13 12:19:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 504. [2022-12-13 12:19:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 380 states have (on average 1.2763157894736843) internal successors, (485), 392 states have internal predecessors, (485), 74 states have call successors, (74), 39 states have call predecessors, (74), 39 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2022-12-13 12:19:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 633 transitions. [2022-12-13 12:19:12,420 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 633 transitions. Word has length 89 [2022-12-13 12:19:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:12,421 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 633 transitions. [2022-12-13 12:19:12,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 12:19:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 633 transitions. [2022-12-13 12:19:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 12:19:12,422 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:12,423 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2022-12-13 12:19:12,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 12:19:12,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 12:19:12,623 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:12,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1274109137, now seen corresponding path program 1 times [2022-12-13 12:19:12,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:12,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892109332] [2022-12-13 12:19:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:12,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 12:19:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 12:19:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 12:19:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 12:19:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 12:19:12,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:12,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892109332] [2022-12-13 12:19:12,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892109332] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:12,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910274413] [2022-12-13 12:19:12,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:12,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:12,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:12,746 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:12,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 12:19:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:12,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:19:12,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 12:19:12,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:19:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 12:19:12,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910274413] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:19:12,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:19:12,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-13 12:19:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363948348] [2022-12-13 12:19:12,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:19:12,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:19:12,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:12,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:19:12,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:19:12,972 INFO L87 Difference]: Start difference. First operand 504 states and 633 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 12:19:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:13,233 INFO L93 Difference]: Finished difference Result 621 states and 801 transitions. [2022-12-13 12:19:13,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:19:13,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2022-12-13 12:19:13,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:13,236 INFO L225 Difference]: With dead ends: 621 [2022-12-13 12:19:13,236 INFO L226 Difference]: Without dead ends: 618 [2022-12-13 12:19:13,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:19:13,238 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 343 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:13,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 551 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:19:13,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-12-13 12:19:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 497. [2022-12-13 12:19:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 376 states have (on average 1.2632978723404256) internal successors, (475), 385 states have internal predecessors, (475), 74 states have call successors, (74), 39 states have call predecessors, (74), 39 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2022-12-13 12:19:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 623 transitions. [2022-12-13 12:19:13,272 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 623 transitions. Word has length 90 [2022-12-13 12:19:13,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:13,272 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 623 transitions. [2022-12-13 12:19:13,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 12:19:13,273 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 623 transitions. [2022-12-13 12:19:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-13 12:19:13,274 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:13,274 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:19:13,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 12:19:13,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:13,475 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:13,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1107796325, now seen corresponding path program 1 times [2022-12-13 12:19:13,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:13,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507554398] [2022-12-13 12:19:13,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 12:19:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 12:19:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 12:19:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 12:19:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 12:19:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 12:19:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 12:19:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 12:19:13,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:13,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507554398] [2022-12-13 12:19:13,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507554398] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:13,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907960333] [2022-12-13 12:19:13,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:13,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:13,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:13,633 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:13,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 12:19:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:13,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 12:19:13,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 12:19:13,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:13,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907960333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:13,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:13,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-12-13 12:19:13,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614288054] [2022-12-13 12:19:13,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:13,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:19:13,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:13,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:19:13,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:19:13,800 INFO L87 Difference]: Start difference. First operand 497 states and 623 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 12:19:13,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:13,877 INFO L93 Difference]: Finished difference Result 1169 states and 1463 transitions. [2022-12-13 12:19:13,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:19:13,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2022-12-13 12:19:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:13,881 INFO L225 Difference]: With dead ends: 1169 [2022-12-13 12:19:13,881 INFO L226 Difference]: Without dead ends: 883 [2022-12-13 12:19:13,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:19:13,883 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 201 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:13,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1338 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:19:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-12-13 12:19:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 691. [2022-12-13 12:19:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 524 states have (on average 1.2595419847328244) internal successors, (660), 536 states have internal predecessors, (660), 103 states have call successors, (103), 53 states have call predecessors, (103), 56 states have return successors, (106), 104 states have call predecessors, (106), 103 states have call successors, (106) [2022-12-13 12:19:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 869 transitions. [2022-12-13 12:19:13,932 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 869 transitions. Word has length 96 [2022-12-13 12:19:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:13,932 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 869 transitions. [2022-12-13 12:19:13,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 12:19:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 869 transitions. [2022-12-13 12:19:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-13 12:19:13,934 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:13,934 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:13,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 12:19:14,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:14,136 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:14,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:14,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1916421667, now seen corresponding path program 1 times [2022-12-13 12:19:14,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:14,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604105406] [2022-12-13 12:19:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:14,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 12:19:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 12:19:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 12:19:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 12:19:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 12:19:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 12:19:14,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:14,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604105406] [2022-12-13 12:19:14,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604105406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:14,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:19:14,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:19:14,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244193424] [2022-12-13 12:19:14,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:14,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:19:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:14,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:19:14,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:19:14,403 INFO L87 Difference]: Start difference. First operand 691 states and 869 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 12:19:14,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:14,785 INFO L93 Difference]: Finished difference Result 1413 states and 1794 transitions. [2022-12-13 12:19:14,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:19:14,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2022-12-13 12:19:14,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:14,789 INFO L225 Difference]: With dead ends: 1413 [2022-12-13 12:19:14,789 INFO L226 Difference]: Without dead ends: 1411 [2022-12-13 12:19:14,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:19:14,791 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 300 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:14,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 601 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 12:19:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-12-13 12:19:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1343. [2022-12-13 12:19:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1019 states have (on average 1.254170755642787) internal successors, (1278), 1036 states have internal predecessors, (1278), 204 states have call successors, (204), 106 states have call predecessors, (204), 112 states have return successors, (225), 206 states have call predecessors, (225), 204 states have call successors, (225) [2022-12-13 12:19:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1707 transitions. [2022-12-13 12:19:14,870 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1707 transitions. Word has length 96 [2022-12-13 12:19:14,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:14,870 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1707 transitions. [2022-12-13 12:19:14,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 12:19:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1707 transitions. [2022-12-13 12:19:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-13 12:19:14,873 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:14,873 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:19:14,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:19:14,873 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1408694220, now seen corresponding path program 1 times [2022-12-13 12:19:14,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:14,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676113686] [2022-12-13 12:19:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:14,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 12:19:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 12:19:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 12:19:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 12:19:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 12:19:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 12:19:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 12:19:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 12:19:14,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:14,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676113686] [2022-12-13 12:19:14,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676113686] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:14,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453159813] [2022-12-13 12:19:14,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:14,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:14,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:14,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:14,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 12:19:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:15,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 12:19:15,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 12:19:15,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:15,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453159813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:15,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:15,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-12-13 12:19:15,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951584132] [2022-12-13 12:19:15,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:15,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:19:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:19:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:19:15,144 INFO L87 Difference]: Start difference. First operand 1343 states and 1707 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 12:19:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:15,260 INFO L93 Difference]: Finished difference Result 2695 states and 3414 transitions. [2022-12-13 12:19:15,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:19:15,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2022-12-13 12:19:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:15,274 INFO L225 Difference]: With dead ends: 2695 [2022-12-13 12:19:15,275 INFO L226 Difference]: Without dead ends: 2125 [2022-12-13 12:19:15,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:19:15,278 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 201 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:15,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1331 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:19:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2022-12-13 12:19:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1343. [2022-12-13 12:19:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1019 states have (on average 1.254170755642787) internal successors, (1278), 1036 states have internal predecessors, (1278), 204 states have call successors, (204), 106 states have call predecessors, (204), 112 states have return successors, (225), 206 states have call predecessors, (225), 204 states have call successors, (225) [2022-12-13 12:19:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1707 transitions. [2022-12-13 12:19:15,396 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1707 transitions. Word has length 100 [2022-12-13 12:19:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:15,396 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1707 transitions. [2022-12-13 12:19:15,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 12:19:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1707 transitions. [2022-12-13 12:19:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-13 12:19:15,399 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:15,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:19:15,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 12:19:15,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 12:19:15,600 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:15,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:15,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1458291270, now seen corresponding path program 1 times [2022-12-13 12:19:15,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:15,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711630118] [2022-12-13 12:19:15,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:15,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:15,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:15,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:15,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 12:19:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:15,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 12:19:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:15,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:15,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 12:19:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:15,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 12:19:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:15,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:15,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 12:19:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:15,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:15,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-12-13 12:19:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 12:19:15,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:15,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711630118] [2022-12-13 12:19:15,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711630118] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:15,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261896262] [2022-12-13 12:19:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:15,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:15,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:15,878 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:15,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 12:19:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:16,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 12:19:16,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 12:19:16,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:16,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261896262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:16,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:16,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2022-12-13 12:19:16,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516082745] [2022-12-13 12:19:16,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:16,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:19:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:16,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:19:16,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:19:16,404 INFO L87 Difference]: Start difference. First operand 1343 states and 1707 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 12:19:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:16,698 INFO L93 Difference]: Finished difference Result 1361 states and 1716 transitions. [2022-12-13 12:19:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:19:16,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 115 [2022-12-13 12:19:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:16,701 INFO L225 Difference]: With dead ends: 1361 [2022-12-13 12:19:16,702 INFO L226 Difference]: Without dead ends: 677 [2022-12-13 12:19:16,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:19:16,704 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 260 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:16,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 301 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:19:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-12-13 12:19:16,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2022-12-13 12:19:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 512 states have (on average 1.248046875) internal successors, (639), 522 states have internal predecessors, (639), 103 states have call successors, (103), 53 states have call predecessors, (103), 56 states have return successors, (106), 104 states have call predecessors, (106), 103 states have call successors, (106) [2022-12-13 12:19:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 848 transitions. [2022-12-13 12:19:16,748 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 848 transitions. Word has length 115 [2022-12-13 12:19:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:16,748 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 848 transitions. [2022-12-13 12:19:16,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 12:19:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 848 transitions. [2022-12-13 12:19:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-13 12:19:16,750 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:16,750 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:19:16,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 12:19:16,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 12:19:16,951 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2060624510, now seen corresponding path program 1 times [2022-12-13 12:19:16,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:16,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12153552] [2022-12-13 12:19:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 12:19:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 12:19:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:19:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 12:19:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 12:19:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 12:19:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 12:19:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 12:19:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 12:19:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 12:19:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 12:19:17,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:17,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12153552] [2022-12-13 12:19:17,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12153552] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:17,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137141428] [2022-12-13 12:19:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:17,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:17,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:17,119 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:17,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 12:19:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:19:17,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 12:19:17,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:17,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137141428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:17,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:17,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-13 12:19:17,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458954744] [2022-12-13 12:19:17,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:17,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:19:17,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:17,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:19:17,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:19:17,335 INFO L87 Difference]: Start difference. First operand 677 states and 848 transitions. Second operand has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 12:19:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:17,401 INFO L93 Difference]: Finished difference Result 677 states and 848 transitions. [2022-12-13 12:19:17,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:19:17,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 129 [2022-12-13 12:19:17,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:17,403 INFO L225 Difference]: With dead ends: 677 [2022-12-13 12:19:17,404 INFO L226 Difference]: Without dead ends: 676 [2022-12-13 12:19:17,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:19:17,404 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 6 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:17,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 731 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:19:17,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-12-13 12:19:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2022-12-13 12:19:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 512 states have (on average 1.24609375) internal successors, (638), 521 states have internal predecessors, (638), 103 states have call successors, (103), 53 states have call predecessors, (103), 56 states have return successors, (106), 104 states have call predecessors, (106), 103 states have call successors, (106) [2022-12-13 12:19:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 847 transitions. [2022-12-13 12:19:17,440 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 847 transitions. Word has length 129 [2022-12-13 12:19:17,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:17,440 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 847 transitions. [2022-12-13 12:19:17,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 12:19:17,440 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 847 transitions. [2022-12-13 12:19:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-13 12:19:17,441 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:17,441 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:17,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 12:19:17,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 12:19:17,642 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:17,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash -545149392, now seen corresponding path program 1 times [2022-12-13 12:19:17,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:17,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345062955] [2022-12-13 12:19:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 12:19:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 12:19:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:19:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 12:19:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 12:19:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 12:19:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 12:19:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 12:19:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 12:19:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 12:19:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 12:19:17,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:17,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345062955] [2022-12-13 12:19:17,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345062955] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:17,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986497686] [2022-12-13 12:19:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:17,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:17,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:17,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:17,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 12:19:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:17,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:19:17,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 12:19:17,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:19:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 12:19:18,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986497686] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:19:18,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:19:18,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-12-13 12:19:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144144980] [2022-12-13 12:19:18,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:19:18,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:19:18,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:18,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:19:18,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:19:18,046 INFO L87 Difference]: Start difference. First operand 676 states and 847 transitions. Second operand has 9 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 6 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-12-13 12:19:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:18,457 INFO L93 Difference]: Finished difference Result 739 states and 937 transitions. [2022-12-13 12:19:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 12:19:18,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 6 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 130 [2022-12-13 12:19:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:18,459 INFO L225 Difference]: With dead ends: 739 [2022-12-13 12:19:18,460 INFO L226 Difference]: Without dead ends: 738 [2022-12-13 12:19:18,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-12-13 12:19:18,461 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 161 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:18,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 635 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 12:19:18,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-12-13 12:19:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 672. [2022-12-13 12:19:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 510 states have (on average 1.2450980392156863) internal successors, (635), 518 states have internal predecessors, (635), 102 states have call successors, (102), 53 states have call predecessors, (102), 56 states have return successors, (105), 103 states have call predecessors, (105), 102 states have call successors, (105) [2022-12-13 12:19:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 842 transitions. [2022-12-13 12:19:18,508 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 842 transitions. Word has length 130 [2022-12-13 12:19:18,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:18,508 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 842 transitions. [2022-12-13 12:19:18,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 6 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-12-13 12:19:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 842 transitions. [2022-12-13 12:19:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-13 12:19:18,510 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:18,510 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:18,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 12:19:18,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 12:19:18,711 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:18,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1741917965, now seen corresponding path program 1 times [2022-12-13 12:19:18,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:18,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446663526] [2022-12-13 12:19:18,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:18,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 12:19:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 12:19:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:19:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 12:19:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 12:19:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:19:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:19:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 12:19:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 12:19:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 12:19:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:18,869 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 12:19:18,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:18,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446663526] [2022-12-13 12:19:18,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446663526] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:18,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621846081] [2022-12-13 12:19:18,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:18,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:18,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:18,871 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:18,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 12:19:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:19:19,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 12:19:19,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:19:19,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621846081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:19:19,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:19:19,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-13 12:19:19,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636209870] [2022-12-13 12:19:19,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:19:19,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:19:19,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:19,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:19:19,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:19:19,175 INFO L87 Difference]: Start difference. First operand 672 states and 842 transitions. Second operand has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 12:19:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:19,304 INFO L93 Difference]: Finished difference Result 672 states and 842 transitions. [2022-12-13 12:19:19,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:19:19,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2022-12-13 12:19:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:19,307 INFO L225 Difference]: With dead ends: 672 [2022-12-13 12:19:19,307 INFO L226 Difference]: Without dead ends: 670 [2022-12-13 12:19:19,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:19:19,308 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 192 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:19,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 449 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:19:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-12-13 12:19:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2022-12-13 12:19:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 510 states have (on average 1.2411764705882353) internal successors, (633), 516 states have internal predecessors, (633), 102 states have call successors, (102), 53 states have call predecessors, (102), 56 states have return successors, (105), 103 states have call predecessors, (105), 102 states have call successors, (105) [2022-12-13 12:19:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 840 transitions. [2022-12-13 12:19:19,370 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 840 transitions. Word has length 131 [2022-12-13 12:19:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:19,370 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 840 transitions. [2022-12-13 12:19:19,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 12:19:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 840 transitions. [2022-12-13 12:19:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-13 12:19:19,373 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:19:19,373 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:19,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 12:19:19,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 12:19:19,574 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-12-13 12:19:19,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:19:19,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1835118270, now seen corresponding path program 1 times [2022-12-13 12:19:19,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:19:19,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592921006] [2022-12-13 12:19:19,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:19,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:19:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 12:19:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 12:19:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 12:19:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 12:19:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:19:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 12:19:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 12:19:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:19:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:19:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:19:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 12:19:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 12:19:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 12:19:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 12:19:19,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:19:19,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592921006] [2022-12-13 12:19:19,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592921006] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:19:19,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006340335] [2022-12-13 12:19:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:19:19,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:19:19,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:19:19,821 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:19:19,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 12:19:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:19:20,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:19:20,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:19:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 12:19:20,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:19:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 12:19:20,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006340335] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:19:20,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:19:20,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-12-13 12:19:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172457099] [2022-12-13 12:19:20,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:19:20,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:19:20,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:19:20,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:19:20,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:19:20,215 INFO L87 Difference]: Start difference. First operand 670 states and 840 transitions. Second operand has 9 states, 8 states have (on average 26.25) internal successors, (210), 7 states have internal predecessors, (210), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2022-12-13 12:19:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:19:20,794 INFO L93 Difference]: Finished difference Result 696 states and 875 transitions. [2022-12-13 12:19:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 12:19:20,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 26.25) internal successors, (210), 7 states have internal predecessors, (210), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) Word has length 132 [2022-12-13 12:19:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:19:20,795 INFO L225 Difference]: With dead ends: 696 [2022-12-13 12:19:20,795 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 12:19:20,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2022-12-13 12:19:20,797 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 649 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 12:19:20,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 594 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 12:19:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 12:19:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 12:19:20,797 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 12:19:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 12:19:20,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2022-12-13 12:19:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:19:20,798 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 12:19:20,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 26.25) internal successors, (210), 7 states have internal predecessors, (210), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2022-12-13 12:19:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 12:19:20,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 12:19:20,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2022-12-13 12:19:20,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2022-12-13 12:19:20,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2022-12-13 12:19:20,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2022-12-13 12:19:20,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2022-12-13 12:19:20,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2022-12-13 12:19:20,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2022-12-13 12:19:20,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2022-12-13 12:19:20,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2022-12-13 12:19:20,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2022-12-13 12:19:20,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2022-12-13 12:19:20,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2022-12-13 12:19:20,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2022-12-13 12:19:20,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2022-12-13 12:19:20,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2022-12-13 12:19:20,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2022-12-13 12:19:20,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 12:19:21,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 12:19:21,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 12:19:26,507 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 940 945) the Hoare annotation is: true [2022-12-13 12:19:26,507 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawFINAL(lines 940 945) no Hoare annotation was computed. [2022-12-13 12:19:26,507 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawEXIT(lines 940 945) no Hoare annotation was computed. [2022-12-13 12:19:26,508 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_file_8_returnLabel#1(lines 1348 1355) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0)))) [2022-12-13 12:19:26,508 INFO L895 garLoopResultBuilder]: At program point L1142(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (= ~ldv_count_2~0 0) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,508 INFO L895 garLoopResultBuilder]: At program point L1076(line 1076) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,508 INFO L895 garLoopResultBuilder]: At program point err_hwmon_register(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (and (<= |s3c_hwmon_probe_~i~0#1| 0) (= ~ldv_count_2~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,508 INFO L899 garLoopResultBuilder]: For program point L1076-1(line 1076) no Hoare annotation was computed. [2022-12-13 12:19:26,508 INFO L895 garLoopResultBuilder]: At program point $Ultimate##39(lines 1134 1137) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= ~ref_cnt~0 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (<= |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= ~ldv_count_1~0 0)))) [2022-12-13 12:19:26,508 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeFINAL(lines 1040 1149) no Hoare annotation was computed. [2022-12-13 12:19:26,509 INFO L895 garLoopResultBuilder]: At program point $Ultimate##37(lines 1124 1127) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (< |s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,509 INFO L895 garLoopResultBuilder]: At program point L1002-1(line 1002) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0)))) [2022-12-13 12:19:26,509 INFO L899 garLoopResultBuilder]: For program point L1118(line 1118) no Hoare annotation was computed. [2022-12-13 12:19:26,509 INFO L899 garLoopResultBuilder]: For program point L1118-1(line 1118) no Hoare annotation was computed. [2022-12-13 12:19:26,509 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1122) no Hoare annotation was computed. [2022-12-13 12:19:26,509 INFO L895 garLoopResultBuilder]: At program point L1507(line 1507) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,509 INFO L899 garLoopResultBuilder]: For program point L1507-1(line 1507) no Hoare annotation was computed. [2022-12-13 12:19:26,510 INFO L895 garLoopResultBuilder]: At program point __mutex_init_returnLabel#1(lines 1455 1457) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,510 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 838) no Hoare annotation was computed. [2022-12-13 12:19:26,510 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-12-13 12:19:26,510 INFO L895 garLoopResultBuilder]: At program point platform_set_drvdata_returnLabel#1(lines 903 909) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,510 INFO L895 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (= ~ldv_count_2~0 0) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,510 INFO L899 garLoopResultBuilder]: For program point L1144-1(line 1144) no Hoare annotation was computed. [2022-12-13 12:19:26,510 INFO L899 garLoopResultBuilder]: For program point L1103(lines 1103 1107) no Hoare annotation was computed. [2022-12-13 12:19:26,510 INFO L899 garLoopResultBuilder]: For program point L1103-2(lines 1103 1107) no Hoare annotation was computed. [2022-12-13 12:19:26,510 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1040 1149) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~ldv_count_2~0 0) (= |old(#valid)| |#valid|)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,511 INFO L895 garLoopResultBuilder]: At program point ldv_kzalloc_9_returnLabel#1(lines 1356 1363) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,511 INFO L895 garLoopResultBuilder]: At program point L1087(line 1087) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,511 INFO L899 garLoopResultBuilder]: For program point L1087-1(line 1087) no Hoare annotation was computed. [2022-12-13 12:19:26,511 INFO L895 garLoopResultBuilder]: At program point L1145(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (= ~ldv_count_2~0 0) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,511 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1132) no Hoare annotation was computed. [2022-12-13 12:19:26,511 INFO L895 garLoopResultBuilder]: At program point s3c_adc_register_returnLabel#1(lines 1506 1508) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,511 INFO L895 garLoopResultBuilder]: At program point L1352(line 1352) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0)))) [2022-12-13 12:19:26,511 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2022-12-13 12:19:26,512 INFO L899 garLoopResultBuilder]: For program point L1352-1(line 1352) no Hoare annotation was computed. [2022-12-13 12:19:26,512 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeEXIT(lines 1040 1149) no Hoare annotation was computed. [2022-12-13 12:19:26,512 INFO L899 garLoopResultBuilder]: For program point L1121(line 1121) no Hoare annotation was computed. [2022-12-13 12:19:26,512 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1094) no Hoare annotation was computed. [2022-12-13 12:19:26,512 INFO L895 garLoopResultBuilder]: At program point L1344(line 1344) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0)))) [2022-12-13 12:19:26,512 INFO L899 garLoopResultBuilder]: For program point L1344-1(line 1344) no Hoare annotation was computed. [2022-12-13 12:19:26,512 INFO L899 garLoopResultBuilder]: For program point L1022(lines 1022 1026) no Hoare annotation was computed. [2022-12-13 12:19:26,512 INFO L895 garLoopResultBuilder]: At program point ldv_zalloc_returnLabel#1(lines 823 840) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,512 INFO L899 garLoopResultBuilder]: For program point L1014(lines 1014 1028) no Hoare annotation was computed. [2022-12-13 12:19:26,513 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1122) no Hoare annotation was computed. [2022-12-13 12:19:26,513 INFO L899 garLoopResultBuilder]: For program point L1014-1(lines 1014 1028) no Hoare annotation was computed. [2022-12-13 12:19:26,513 INFO L895 garLoopResultBuilder]: At program point ldv_10008(lines 1115 1129) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 0 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0)) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,513 INFO L895 garLoopResultBuilder]: At program point dev_set_drvdata_returnLabel#1(lines 1469 1471) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,513 INFO L899 garLoopResultBuilder]: For program point L1122(line 1122) no Hoare annotation was computed. [2022-12-13 12:19:26,513 INFO L895 garLoopResultBuilder]: At program point L833(line 833) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,513 INFO L899 garLoopResultBuilder]: For program point L1056(lines 1056 1060) no Hoare annotation was computed. [2022-12-13 12:19:26,513 INFO L899 garLoopResultBuilder]: For program point L833-1(line 833) no Hoare annotation was computed. [2022-12-13 12:19:26,513 INFO L895 garLoopResultBuilder]: At program point L1023(line 1023) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0)))) [2022-12-13 12:19:26,514 INFO L899 garLoopResultBuilder]: For program point L1023-1(line 1023) no Hoare annotation was computed. [2022-12-13 12:19:26,514 INFO L895 garLoopResultBuilder]: At program point hwmon_device_register_returnLabel#1(lines 1479 1481) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,514 INFO L895 garLoopResultBuilder]: At program point ldv_10012(lines 1053 1148) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0)))) [2022-12-13 12:19:26,514 INFO L895 garLoopResultBuilder]: At program point L1015-1(line 1015) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0)))) [2022-12-13 12:19:26,514 INFO L895 garLoopResultBuilder]: At program point L1073(line 1073) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,514 INFO L899 garLoopResultBuilder]: For program point L1073-1(line 1073) no Hoare annotation was computed. [2022-12-13 12:19:26,514 INFO L895 garLoopResultBuilder]: At program point L1131(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (or (= |s3c_hwmon_probe_~i~0#1| 0) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646))) (= ~ldv_count_2~0 0)) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,514 INFO L895 garLoopResultBuilder]: At program point L1090(line 1090) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,514 INFO L899 garLoopResultBuilder]: For program point L1090-1(line 1090) no Hoare annotation was computed. [2022-12-13 12:19:26,515 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_create_attr_returnLabel#1(lines 996 1031) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0)))) [2022-12-13 12:19:26,515 INFO L899 garLoopResultBuilder]: For program point L1115(lines 1115 1130) no Hoare annotation was computed. [2022-12-13 12:19:26,515 INFO L899 garLoopResultBuilder]: For program point L1082(lines 1082 1085) no Hoare annotation was computed. [2022-12-13 12:19:26,515 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (and (<= |s3c_hwmon_probe_~i~0#1| 0) (= ~ldv_count_2~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,515 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2022-12-13 12:19:26,515 INFO L899 garLoopResultBuilder]: For program point L1074(lines 1074 1080) no Hoare annotation was computed. [2022-12-13 12:19:26,515 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1132) no Hoare annotation was computed. [2022-12-13 12:19:26,515 INFO L899 garLoopResultBuilder]: For program point L1132(line 1132) no Hoare annotation was computed. [2022-12-13 12:19:26,515 INFO L899 garLoopResultBuilder]: For program point L1099(lines 1099 1102) no Hoare annotation was computed. [2022-12-13 12:19:26,516 INFO L895 garLoopResultBuilder]: At program point L835(line 835) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,516 INFO L895 garLoopResultBuilder]: At program point L835-1(line 835) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,516 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_file_7_returnLabel#1(lines 1340 1347) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0)))) [2022-12-13 12:19:26,516 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-12-13 12:19:26,516 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_add_raw_returnLabel#1(lines 934 939) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,516 INFO L895 garLoopResultBuilder]: At program point L1141(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (= ~ldv_count_2~0 0) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,516 INFO L899 garLoopResultBuilder]: For program point L1108(lines 1108 1112) no Hoare annotation was computed. [2022-12-13 12:19:26,516 INFO L899 garLoopResultBuilder]: For program point L1009(lines 1009 1013) no Hoare annotation was computed. [2022-12-13 12:19:26,516 INFO L899 garLoopResultBuilder]: For program point L1513(lines 1513 1515) no Hoare annotation was computed. [2022-12-13 12:19:26,517 INFO L895 garLoopResultBuilder]: At program point L1480(line 1480) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,517 INFO L899 garLoopResultBuilder]: For program point L1480-1(line 1480) no Hoare annotation was computed. [2022-12-13 12:19:26,517 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2022-12-13 12:19:26,517 INFO L895 garLoopResultBuilder]: At program point L836-1(line 836) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,517 INFO L899 garLoopResultBuilder]: For program point L836-2(line 836) no Hoare annotation was computed. [2022-12-13 12:19:26,517 INFO L902 garLoopResultBuilder]: At program point dev_get_drvdata_returnLabel#1(lines 1462 1464) the Hoare annotation is: true [2022-12-13 12:19:26,517 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataEXIT(lines 895 902) no Hoare annotation was computed. [2022-12-13 12:19:26,517 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 895 902) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= ~ref_cnt~0 1)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,517 INFO L895 garLoopResultBuilder]: At program point L1463(line 1463) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= ~ref_cnt~0 1)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,517 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataFINAL(lines 895 902) no Hoare annotation was computed. [2022-12-13 12:19:26,518 INFO L899 garLoopResultBuilder]: For program point L1463-1(line 1463) no Hoare annotation was computed. [2022-12-13 12:19:26,518 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intFINAL(lines 860 867) no Hoare annotation was computed. [2022-12-13 12:19:26,518 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 860 867) the Hoare annotation is: true [2022-12-13 12:19:26,518 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intEXIT(lines 860 867) no Hoare annotation was computed. [2022-12-13 12:19:26,518 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 1482 1484) no Hoare annotation was computed. [2022-12-13 12:19:26,518 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1482 1484) the Hoare annotation is: true [2022-12-13 12:19:26,518 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 1482 1484) no Hoare annotation was computed. [2022-12-13 12:19:26,518 INFO L902 garLoopResultBuilder]: At program point LDV_STOP(lines 876 882) the Hoare annotation is: true [2022-12-13 12:19:26,518 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 876 882) no Hoare annotation was computed. [2022-12-13 12:19:26,518 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-12-13 12:19:26,519 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (= |#memory_int| |old(#memory_int)|) (not (= ~ref_cnt~0 0)) (not (= ~ldv_count_2~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,519 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-12-13 12:19:26,519 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseEXIT(lines 1509 1511) no Hoare annotation was computed. [2022-12-13 12:19:26,519 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1509 1511) the Hoare annotation is: true [2022-12-13 12:19:26,519 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseFINAL(lines 1509 1511) no Hoare annotation was computed. [2022-12-13 12:19:26,519 INFO L899 garLoopResultBuilder]: For program point L801(line 801) no Hoare annotation was computed. [2022-12-13 12:19:26,519 INFO L899 garLoopResultBuilder]: For program point L801-2(lines 800 802) no Hoare annotation was computed. [2022-12-13 12:19:26,519 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 800 802) the Hoare annotation is: true [2022-12-13 12:19:26,519 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 800 802) no Hoare annotation was computed. [2022-12-13 12:19:26,519 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeFINAL(lines 1150 1173) no Hoare annotation was computed. [2022-12-13 12:19:26,519 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeEXIT(lines 1150 1173) no Hoare annotation was computed. [2022-12-13 12:19:26,520 INFO L895 garLoopResultBuilder]: At program point L1170(line 1170) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (<= 1 s3c_hwmon_remove_~i~1) (<= s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (<= ~ref_cnt~0 1)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,520 INFO L895 garLoopResultBuilder]: At program point L1169(line 1169) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (<= 1 s3c_hwmon_remove_~i~1) (<= s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (<= ~ref_cnt~0 1)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,520 INFO L899 garLoopResultBuilder]: For program point L1170-1(line 1170) no Hoare annotation was computed. [2022-12-13 12:19:26,520 INFO L899 garLoopResultBuilder]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2022-12-13 12:19:26,520 INFO L895 garLoopResultBuilder]: At program point ldv_10022(lines 1155 1172) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (= s3c_hwmon_remove_~i~1 0) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (and (<= 1 s3c_hwmon_remove_~i~1) (< s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_count_2~0 0)) (not (<= ~ref_cnt~0 1)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,520 INFO L899 garLoopResultBuilder]: For program point L1163(line 1163) no Hoare annotation was computed. [2022-12-13 12:19:26,520 INFO L899 garLoopResultBuilder]: For program point L1162(line 1162) no Hoare annotation was computed. [2022-12-13 12:19:26,520 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1150 1173) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= ~ref_cnt~0 1)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,520 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1163) no Hoare annotation was computed. [2022-12-13 12:19:26,521 INFO L902 garLoopResultBuilder]: At program point L1158(line 1158) the Hoare annotation is: true [2022-12-13 12:19:26,521 INFO L899 garLoopResultBuilder]: For program point L1158-1(line 1158) no Hoare annotation was computed. [2022-12-13 12:19:26,521 INFO L895 garLoopResultBuilder]: At program point L1156(line 1156) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= ~ref_cnt~0 1)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,521 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1163) no Hoare annotation was computed. [2022-12-13 12:19:26,521 INFO L899 garLoopResultBuilder]: For program point L1156-1(line 1156) no Hoare annotation was computed. [2022-12-13 12:19:26,521 INFO L895 garLoopResultBuilder]: At program point $Ultimate##2(lines 1165 1168) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (= s3c_hwmon_remove_~i~1 0) (and (<= 1 s3c_hwmon_remove_~i~1) (<= s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (<= ~ref_cnt~0 1)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,521 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1324 1331) the Hoare annotation is: true [2022-12-13 12:19:26,521 INFO L899 garLoopResultBuilder]: For program point PTR_ERREXIT(lines 1324 1331) no Hoare annotation was computed. [2022-12-13 12:19:26,521 INFO L902 garLoopResultBuilder]: At program point ldv_ptr_err_returnLabel#1(lines 1397 1402) the Hoare annotation is: true [2022-12-13 12:19:26,522 INFO L899 garLoopResultBuilder]: For program point PTR_ERRFINAL(lines 1324 1331) no Hoare annotation was computed. [2022-12-13 12:19:26,522 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 1385 1390) no Hoare annotation was computed. [2022-12-13 12:19:26,522 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1385 1390) the Hoare annotation is: true [2022-12-13 12:19:26,522 INFO L899 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 1385 1390) no Hoare annotation was computed. [2022-12-13 12:19:26,522 INFO L902 garLoopResultBuilder]: At program point L817(line 817) the Hoare annotation is: true [2022-12-13 12:19:26,522 INFO L902 garLoopResultBuilder]: At program point L818-1(line 818) the Hoare annotation is: true [2022-12-13 12:19:26,522 INFO L902 garLoopResultBuilder]: At program point L817-1(line 817) the Hoare annotation is: true [2022-12-13 12:19:26,522 INFO L899 garLoopResultBuilder]: For program point L818-2(line 818) no Hoare annotation was computed. [2022-12-13 12:19:26,522 INFO L899 garLoopResultBuilder]: For program point L812(lines 812 820) no Hoare annotation was computed. [2022-12-13 12:19:26,522 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 805 822) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_state_variable_0~0 2))) (.cse1 (not (= ~ldv_count_2~0 0))) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse3 (not (<= ~ldv_count_1~0 0)))) (and (or .cse0 (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= ~ref_cnt~0 1)) .cse3) (or (not (<= ~probed_1~0 0)) .cse0 (not (<= 0 ~ref_cnt~0)) .cse1 .cse2 (not (<= ~ref_cnt~0 0)) .cse3))) [2022-12-13 12:19:26,523 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 805 822) no Hoare annotation was computed. [2022-12-13 12:19:26,523 INFO L899 garLoopResultBuilder]: For program point L818(line 818) no Hoare annotation was computed. [2022-12-13 12:19:26,523 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 805 822) no Hoare annotation was computed. [2022-12-13 12:19:26,523 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1476 1478) the Hoare annotation is: true [2022-12-13 12:19:26,523 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 1476 1478) no Hoare annotation was computed. [2022-12-13 12:19:26,523 INFO L899 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 1476 1478) no Hoare annotation was computed. [2022-12-13 12:19:26,523 INFO L899 garLoopResultBuilder]: For program point L1249(line 1249) no Hoare annotation was computed. [2022-12-13 12:19:26,523 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1254) no Hoare annotation was computed. [2022-12-13 12:19:26,523 INFO L902 garLoopResultBuilder]: At program point platform_driver_unregister_returnLabel#1(lines 1499 1501) the Hoare annotation is: true [2022-12-13 12:19:26,523 INFO L899 garLoopResultBuilder]: For program point L1307(line 1307) no Hoare annotation was computed. [2022-12-13 12:19:26,524 INFO L895 garLoopResultBuilder]: At program point ldv_initialize_returnLabel#1(lines 1449 1454) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-12-13 12:19:26,524 INFO L899 garLoopResultBuilder]: For program point L1233(line 1233) no Hoare annotation was computed. [2022-12-13 12:19:26,524 INFO L899 garLoopResultBuilder]: For program point L1291(lines 1291 1305) no Hoare annotation was computed. [2022-12-13 12:19:26,524 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 1220 1323) the Hoare annotation is: true [2022-12-13 12:19:26,524 INFO L899 garLoopResultBuilder]: For program point L1283(lines 1283 1288) no Hoare annotation was computed. [2022-12-13 12:19:26,524 INFO L899 garLoopResultBuilder]: For program point L1250(lines 1250 1259) no Hoare annotation was computed. [2022-12-13 12:19:26,524 INFO L899 garLoopResultBuilder]: For program point L1250-1(lines 1236 1273) no Hoare annotation was computed. [2022-12-13 12:19:26,524 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1242) no Hoare annotation was computed. [2022-12-13 12:19:26,524 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 12:19:26,524 INFO L902 garLoopResultBuilder]: At program point L1308(line 1308) the Hoare annotation is: true [2022-12-13 12:19:26,524 INFO L899 garLoopResultBuilder]: For program point L1242(line 1242) no Hoare annotation was computed. [2022-12-13 12:19:26,525 INFO L899 garLoopResultBuilder]: For program point L1242-1(line 1242) no Hoare annotation was computed. [2022-12-13 12:19:26,525 INFO L899 garLoopResultBuilder]: For program point L1234(lines 1234 1276) no Hoare annotation was computed. [2022-12-13 12:19:26,525 INFO L895 garLoopResultBuilder]: At program point L1251(line 1251) the Hoare annotation is: false [2022-12-13 12:19:26,525 INFO L899 garLoopResultBuilder]: For program point L1251-1(line 1251) no Hoare annotation was computed. [2022-12-13 12:19:26,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1242) no Hoare annotation was computed. [2022-12-13 12:19:26,525 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2022-12-13 12:19:26,525 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 12:19:26,525 INFO L899 garLoopResultBuilder]: For program point L1252(lines 1252 1257) no Hoare annotation was computed. [2022-12-13 12:19:26,525 INFO L902 garLoopResultBuilder]: At program point main_ldv_final#1(lines 1225 1322) the Hoare annotation is: true [2022-12-13 12:19:26,525 INFO L899 garLoopResultBuilder]: For program point L1236(lines 1236 1273) no Hoare annotation was computed. [2022-12-13 12:19:26,526 INFO L895 garLoopResultBuilder]: At program point L1261(line 1261) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (= ~ldv_state_variable_0~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (<= ~ref_cnt~0 1)) [2022-12-13 12:19:26,526 INFO L899 garLoopResultBuilder]: For program point L1261-1(line 1261) no Hoare annotation was computed. [2022-12-13 12:19:26,526 INFO L899 garLoopResultBuilder]: For program point L1278(line 1278) no Hoare annotation was computed. [2022-12-13 12:19:26,526 INFO L899 garLoopResultBuilder]: For program point L1237(line 1237) no Hoare annotation was computed. [2022-12-13 12:19:26,526 INFO L899 garLoopResultBuilder]: For program point L1262(lines 1262 1267) no Hoare annotation was computed. [2022-12-13 12:19:26,526 INFO L899 garLoopResultBuilder]: For program point L1254(line 1254) no Hoare annotation was computed. [2022-12-13 12:19:26,526 INFO L899 garLoopResultBuilder]: For program point L1254-1(line 1254) no Hoare annotation was computed. [2022-12-13 12:19:26,526 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 12:19:26,526 INFO L899 garLoopResultBuilder]: For program point L1279(lines 1279 1312) no Hoare annotation was computed. [2022-12-13 12:19:26,526 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1264) no Hoare annotation was computed. [2022-12-13 12:19:26,527 INFO L899 garLoopResultBuilder]: For program point L1271(line 1271) no Hoare annotation was computed. [2022-12-13 12:19:26,527 INFO L899 garLoopResultBuilder]: For program point L1238(lines 1238 1247) no Hoare annotation was computed. [2022-12-13 12:19:26,527 INFO L895 garLoopResultBuilder]: At program point L1230(lines 1225 1322) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (<= ~probed_1~0 0)) (.cse4 (= ~ldv_state_variable_1~0 0)) (.cse1 (= ~ldv_state_variable_0~0 2))) (or (and .cse0 (= ~ldv_state_variable_1~0 2) .cse1 (<= 1 ~ref_cnt~0) .cse2 (<= ~ref_cnt~0 1)) (and .cse0 (<= ~ref_cnt~0 0) .cse3 (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 .cse3 .cse4 (= ~ref_cnt~0 0) .cse2) (and .cse3 .cse4 .cse1))) [2022-12-13 12:19:26,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 12:19:26,527 INFO L895 garLoopResultBuilder]: At program point L1214(line 1214) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-12-13 12:19:26,527 INFO L899 garLoopResultBuilder]: For program point L1214-1(line 1214) no Hoare annotation was computed. [2022-12-13 12:19:26,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1264) no Hoare annotation was computed. [2022-12-13 12:19:26,527 INFO L902 garLoopResultBuilder]: At program point L1272(line 1272) the Hoare annotation is: true [2022-12-13 12:19:26,527 INFO L895 garLoopResultBuilder]: At program point L1239(line 1239) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= ~probed_1~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_0~0 2) (= ~ldv_count_2~0 0)) [2022-12-13 12:19:26,527 INFO L899 garLoopResultBuilder]: For program point L1239-1(line 1239) no Hoare annotation was computed. [2022-12-13 12:19:26,528 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_init_returnLabel#1(lines 1177 1184) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-12-13 12:19:26,528 INFO L899 garLoopResultBuilder]: For program point L1264(line 1264) no Hoare annotation was computed. [2022-12-13 12:19:26,528 INFO L899 garLoopResultBuilder]: For program point L1264-1(line 1264) no Hoare annotation was computed. [2022-12-13 12:19:26,528 INFO L899 garLoopResultBuilder]: For program point L1314(line 1314) no Hoare annotation was computed. [2022-12-13 12:19:26,528 INFO L899 garLoopResultBuilder]: For program point L1281(lines 1281 1309) no Hoare annotation was computed. [2022-12-13 12:19:26,528 INFO L895 garLoopResultBuilder]: At program point platform_driver_register_returnLabel#1(lines 1496 1498) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-12-13 12:19:26,528 INFO L895 garLoopResultBuilder]: At program point L1215(line 1215) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-12-13 12:19:26,528 INFO L895 garLoopResultBuilder]: At program point ldv_platform_driver_init_1_returnLabel#1(lines 1210 1219) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-12-13 12:19:26,528 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1254) no Hoare annotation was computed. [2022-12-13 12:19:26,528 INFO L899 garLoopResultBuilder]: For program point L1215-1(line 1215) no Hoare annotation was computed. [2022-12-13 12:19:26,529 INFO L899 garLoopResultBuilder]: For program point L1240(lines 1240 1245) no Hoare annotation was computed. [2022-12-13 12:19:26,529 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_exit_returnLabel#1(lines 1185 1191) the Hoare annotation is: true [2022-12-13 12:19:26,529 INFO L899 garLoopResultBuilder]: For program point L1298(lines 1298 1303) no Hoare annotation was computed. [2022-12-13 12:19:26,529 INFO L899 garLoopResultBuilder]: For program point L1232(lines 1232 1316) no Hoare annotation was computed. [2022-12-13 12:19:26,529 INFO L899 garLoopResultBuilder]: For program point L1290(line 1290) no Hoare annotation was computed. [2022-12-13 12:19:26,529 INFO L902 garLoopResultBuilder]: At program point L1315(line 1315) the Hoare annotation is: true [2022-12-13 12:19:26,529 INFO L902 garLoopResultBuilder]: At program point ldv_check_final_state_returnLabel#1(lines 1485 1487) the Hoare annotation is: true [2022-12-13 12:19:26,529 INFO L899 garLoopResultBuilder]: For program point L1282(line 1282) no Hoare annotation was computed. [2022-12-13 12:19:26,529 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrEXIT(lines 1032 1039) no Hoare annotation was computed. [2022-12-13 12:19:26,529 INFO L902 garLoopResultBuilder]: At program point L1035(line 1035) the Hoare annotation is: true [2022-12-13 12:19:26,529 INFO L902 garLoopResultBuilder]: At program point L1035-1(line 1035) the Hoare annotation is: true [2022-12-13 12:19:26,530 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrFINAL(lines 1032 1039) no Hoare annotation was computed. [2022-12-13 12:19:26,530 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1032 1039) the Hoare annotation is: true [2022-12-13 12:19:26,530 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1437) no Hoare annotation was computed. [2022-12-13 12:19:26,530 INFO L899 garLoopResultBuilder]: For program point L1437(line 1437) no Hoare annotation was computed. [2022-12-13 12:19:26,530 INFO L899 garLoopResultBuilder]: For program point L1437-1(line 1437) no Hoare annotation was computed. [2022-12-13 12:19:26,530 INFO L895 garLoopResultBuilder]: At program point L1435(line 1435) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= |old(~ldv_count_2~0)| ~ldv_count_2~0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,530 INFO L899 garLoopResultBuilder]: For program point L1435-1(line 1435) no Hoare annotation was computed. [2022-12-13 12:19:26,530 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileFINAL(lines 1430 1448) no Hoare annotation was computed. [2022-12-13 12:19:26,530 INFO L899 garLoopResultBuilder]: For program point L1367(line 1367) no Hoare annotation was computed. [2022-12-13 12:19:26,530 INFO L895 garLoopResultBuilder]: At program point ldv_undef_int_negative_returnLabel#1(lines 1371 1384) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= |old(~ldv_count_2~0)| ~ldv_count_2~0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,531 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1430 1448) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= |old(~ldv_count_2~0)| ~ldv_count_2~0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,531 INFO L899 garLoopResultBuilder]: For program point L1378(lines 1378 1381) no Hoare annotation was computed. [2022-12-13 12:19:26,531 INFO L899 garLoopResultBuilder]: For program point L1378-1(lines 1378 1381) no Hoare annotation was computed. [2022-12-13 12:19:26,531 INFO L895 garLoopResultBuilder]: At program point L1376(line 1376) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (= |old(~ldv_count_2~0)| ~ldv_count_2~0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,531 INFO L899 garLoopResultBuilder]: For program point L1376-1(line 1376) no Hoare annotation was computed. [2022-12-13 12:19:26,531 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1437) no Hoare annotation was computed. [2022-12-13 12:19:26,531 INFO L899 garLoopResultBuilder]: For program point L1438(lines 1438 1441) no Hoare annotation was computed. [2022-12-13 12:19:26,531 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileEXIT(lines 1430 1448) no Hoare annotation was computed. [2022-12-13 12:19:26,531 INFO L899 garLoopResultBuilder]: For program point L1436(lines 1436 1446) no Hoare annotation was computed. [2022-12-13 12:19:26,531 INFO L899 garLoopResultBuilder]: For program point L1438-2(lines 1438 1441) no Hoare annotation was computed. [2022-12-13 12:19:26,532 INFO L899 garLoopResultBuilder]: For program point L1364(lines 1364 1370) no Hoare annotation was computed. [2022-12-13 12:19:26,532 INFO L895 garLoopResultBuilder]: At program point L1379(line 1379) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (= |old(~ldv_count_2~0)| ~ldv_count_2~0) (not (<= ~ldv_count_1~0 0))) [2022-12-13 12:19:26,532 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 1332 1339) no Hoare annotation was computed. [2022-12-13 12:19:26,532 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1332 1339) the Hoare annotation is: true [2022-12-13 12:19:26,532 INFO L902 garLoopResultBuilder]: At program point L1336(line 1336) the Hoare annotation is: true [2022-12-13 12:19:26,532 INFO L899 garLoopResultBuilder]: For program point L1336-1(line 1336) no Hoare annotation was computed. [2022-12-13 12:19:26,532 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 1332 1339) no Hoare annotation was computed. [2022-12-13 12:19:26,535 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:19:26,537 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:19:26,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:19:26 BoogieIcfgContainer [2022-12-13 12:19:26,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:19:26,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:19:26,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:19:26,562 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:19:26,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:19:07" (3/4) ... [2022-12-13 12:19:26,565 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 12:19:26,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2022-12-13 12:19:26,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_probe [2022-12-13 12:19:26,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2022-12-13 12:19:26,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2022-12-13 12:19:26,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-12-13 12:19:26,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove [2022-12-13 12:19:26,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2022-12-13 12:19:26,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2022-12-13 12:19:26,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2022-12-13 12:19:26,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-12-13 12:19:26,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2022-12-13 12:19:26,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-12-13 12:19:26,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2022-12-13 12:19:26,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2022-12-13 12:19:26,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2022-12-13 12:19:26,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file [2022-12-13 12:19:26,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2022-12-13 12:19:26,587 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2022-12-13 12:19:26,587 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-12-13 12:19:26,588 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-12-13 12:19:26,588 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 12:19:26,589 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 12:19:26,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || ldv_count_2 == 0) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || ldv_count_2 == 0) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || ldv_count_2 == 0) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i < 2147483646 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || (i <= 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((0 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((i == 0 || (1 <= i && i < 2147483646)) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(ref_cnt == 0)) || ((1 <= i && i <= 2147483646) && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || \old(ldv_count_2) == ldv_count_2) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,615 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-12-13 12:19:26,653 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 12:19:26,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:19:26,654 INFO L158 Benchmark]: Toolchain (without parser) took 20537.17ms. Allocated memory was 115.3MB in the beginning and 239.1MB in the end (delta: 123.7MB). Free memory was 83.2MB in the beginning and 190.1MB in the end (delta: -106.9MB). Peak memory consumption was 148.7MB. Max. memory is 16.1GB. [2022-12-13 12:19:26,654 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory was 80.1MB in the beginning and 80.0MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:19:26,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.80ms. Allocated memory is still 115.3MB. Free memory was 82.7MB in the beginning and 48.8MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-12-13 12:19:26,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.77ms. Allocated memory is still 115.3MB. Free memory was 48.8MB in the beginning and 45.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 12:19:26,655 INFO L158 Benchmark]: Boogie Preprocessor took 55.42ms. Allocated memory was 115.3MB in the beginning and 165.7MB in the end (delta: 50.3MB). Free memory was 45.0MB in the beginning and 134.6MB in the end (delta: -89.6MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2022-12-13 12:19:26,655 INFO L158 Benchmark]: RCFGBuilder took 689.52ms. Allocated memory is still 165.7MB. Free memory was 134.5MB in the beginning and 92.0MB in the end (delta: 42.5MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2022-12-13 12:19:26,655 INFO L158 Benchmark]: TraceAbstraction took 19196.60ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 91.0MB in the beginning and 62.9MB in the end (delta: 28.1MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. [2022-12-13 12:19:26,656 INFO L158 Benchmark]: Witness Printer took 91.49ms. Allocated memory is still 239.1MB. Free memory was 62.9MB in the beginning and 190.1MB in the end (delta: -127.3MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2022-12-13 12:19:26,657 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.13ms. Allocated memory is still 115.3MB. Free memory was 80.1MB in the beginning and 80.0MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.80ms. Allocated memory is still 115.3MB. Free memory was 82.7MB in the beginning and 48.8MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.77ms. Allocated memory is still 115.3MB. Free memory was 48.8MB in the beginning and 45.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.42ms. Allocated memory was 115.3MB in the beginning and 165.7MB in the end (delta: 50.3MB). Free memory was 45.0MB in the beginning and 134.6MB in the end (delta: -89.6MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * RCFGBuilder took 689.52ms. Allocated memory is still 165.7MB. Free memory was 134.5MB in the beginning and 92.0MB in the end (delta: 42.5MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19196.60ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 91.0MB in the beginning and 62.9MB in the end (delta: 28.1MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. * Witness Printer took 91.49ms. Allocated memory is still 239.1MB. Free memory was 62.9MB in the beginning and 190.1MB in the end (delta: -127.3MB). Peak memory consumption was 3.4MB. 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: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 237 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3889 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3667 mSDsluCounter, 11402 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7180 mSDsCounter, 1163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3546 IncrementalHoareTripleChecker+Invalid, 4709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1163 mSolverCounterUnsat, 4222 mSDtfsCounter, 3546 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1827 GetRequests, 1719 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1343occurred in iteration=11, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 1553 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 91 LocationsWithAnnotation, 2803 PreInvPairs, 3002 NumberOfFragments, 1934 HoareAnnotationTreeSize, 2803 FomulaSimplifications, 70614 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 91 FomulaSimplificationsInter, 33851 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2605 NumberOfCodeBlocks, 2605 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2927 ConstructedInterpolants, 0 QuantifiedInterpolants, 5613 SizeOfPredicates, 3 NumberOfNonLiveVariables, 7311 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 30 InterpolantComputations, 14 PerfectInterpolantSequences, 760/839 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 16 specifications checked. All of them hold - InvariantResult [Line: 1371]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || \old(ldv_count_2) == ldv_count_2) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1499]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1177]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && probed_1 <= 0) && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || ldv_count_2 == 0) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1469]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1479]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((0 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 823]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1210]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && probed_1 <= 0) && ldv_state_variable_0 == 2) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1506]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1225]: Loop Invariant Derived loop invariant: (((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 2) && ldv_state_variable_0 == 2) && 1 <= ref_cnt) && ldv_count_2 == 0) && ref_cnt <= 1) || (((((ldv_count_1 <= 0 && ref_cnt <= 0) && probed_1 <= 0) && 0 <= ref_cnt) && ldv_state_variable_0 == 2) && ldv_count_2 == 0)) || ((((ldv_count_1 <= 0 && probed_1 <= 0) && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0)) || ((probed_1 <= 0 && ldv_state_variable_1 == 0) && ldv_state_variable_0 == 2) - InvariantResult [Line: 1225]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((i == 0 || (1 <= i && i < 2147483646)) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1155]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_0 == 2) || i == 0) || !(ldv_state_variable_1 == 2)) || !(1 <= ref_cnt)) || (1 <= i && i < 2147483646)) || !(ldv_count_2 == 0)) || !(ref_cnt <= 1)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1134]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(ref_cnt == 0)) || ((1 <= i && i <= 2147483646) && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1165]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_0 == 2) || i == 0) || (1 <= i && i <= 2147483646)) || !(ldv_state_variable_1 == 2)) || !(1 <= ref_cnt)) || !(ldv_count_2 == 0)) || !(ref_cnt <= 1)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1496]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && probed_1 <= 0) && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1185]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1397]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1356]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1124]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i < 2147483646 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1015]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1348]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1340]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 903]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || ldv_count_2 == 0) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || ldv_count_2 == 0) || !(ldv_count_1 <= 0) - InvariantResult [Line: 996]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || (i <= 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1462]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1455]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) - InvariantResult [Line: 1449]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && probed_1 <= 0) && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 RESULT: Ultimate proved your program to be correct! [2022-12-13 12:19:26,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f5a4cf-c239-4542-96ed-031cc844a94f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE