./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/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_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R --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-38b53e6 [2022-11-25 17:06:40,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:06:40,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:06:40,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:06:40,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:06:40,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:06:40,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:06:40,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:06:40,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:06:40,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:06:40,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:06:40,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:06:40,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:06:40,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:06:40,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:06:40,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:06:40,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:06:40,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:06:40,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:06:40,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:06:40,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:06:40,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:06:40,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:06:40,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:06:40,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:06:40,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:06:40,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:06:40,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:06:40,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:06:40,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:06:40,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:06:40,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:06:40,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:06:40,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:06:40,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:06:40,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:06:40,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:06:40,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:06:40,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:06:40,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:06:40,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:06:40,195 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 17:06:40,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:06:40,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:06:40,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:06:40,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:06:40,221 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:06:40,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:06:40,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:06:40,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:06:40,223 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:06:40,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:06:40,223 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:06:40,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:06:40,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:06:40,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:06:40,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:06:40,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:06:40,225 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 17:06:40,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:06:40,226 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:06:40,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:06:40,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:06:40,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:06:40,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:06:40,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:06:40,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:06:40,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:06:40,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:06:40,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:06:40,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:06:40,229 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:06:40,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:06:40,230 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:06:40,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:06:40,230 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_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-11-25 17:06:40,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:06:40,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:06:40,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:06:40,550 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:06:40,551 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:06:40,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/../../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-11-25 17:06:43,694 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:06:44,015 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:06:44,015 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/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-11-25 17:06:44,034 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/data/cae8fc82f/25db5ca8e507467882e94634b42d91f2/FLAGdf19542ec [2022-11-25 17:06:44,051 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/data/cae8fc82f/25db5ca8e507467882e94634b42d91f2 [2022-11-25 17:06:44,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:06:44,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:06:44,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:06:44,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:06:44,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:06:44,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:06:44" (1/1) ... [2022-11-25 17:06:44,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c12df10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44, skipping insertion in model container [2022-11-25 17:06:44,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:06:44" (1/1) ... [2022-11-25 17:06:44,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:06:44,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:06:44,444 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-11-25 17:06:44,448 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-11-25 17:06:44,454 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_interruptible_nested [2022-11-25 17:06:44,458 WARN L623 FunctionHandler]: Unknown extern function dev_printk [2022-11-25 17:06:44,460 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_read [2022-11-25 17:06:44,471 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-11-25 17:06:44,502 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,510 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-11-25 17:06:44,519 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,521 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-11-25 17:06:44,523 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-11-25 17:06:44,526 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,532 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,537 WARN L623 FunctionHandler]: Unknown extern function __mutex_init [2022-11-25 17:06:44,539 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_register [2022-11-25 17:06:44,541 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,550 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_register [2022-11-25 17:06:44,551 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,554 WARN L623 FunctionHandler]: Unknown extern function dev_warn [2022-11-25 17:06:44,555 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,560 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,564 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_unregister [2022-11-25 17:06:44,568 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_release [2022-11-25 17:06:44,569 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 17:06:44,575 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_unregister [2022-11-25 17:06:44,583 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_release [2022-11-25 17:06:44,586 WARN L623 FunctionHandler]: Unknown extern function platform_driver_register [2022-11-25 17:06:44,591 WARN L623 FunctionHandler]: Unknown extern function platform_driver_unregister [2022-11-25 17:06:44,606 WARN L623 FunctionHandler]: Unknown extern function ldv_check_final_state [2022-11-25 17:06:44,623 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_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/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-11-25 17:06:44,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:06:44,667 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:06:44,716 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-11-25 17:06:44,718 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-11-25 17:06:44,719 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_interruptible_nested [2022-11-25 17:06:44,720 WARN L623 FunctionHandler]: Unknown extern function dev_printk [2022-11-25 17:06:44,721 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_read [2022-11-25 17:06:44,722 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-11-25 17:06:44,735 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,741 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-11-25 17:06:44,742 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,743 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-11-25 17:06:44,744 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-11-25 17:06:44,746 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,748 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,749 WARN L623 FunctionHandler]: Unknown extern function __mutex_init [2022-11-25 17:06:44,750 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_register [2022-11-25 17:06:44,751 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,753 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_register [2022-11-25 17:06:44,754 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,757 WARN L623 FunctionHandler]: Unknown extern function dev_warn [2022-11-25 17:06:44,758 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,760 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 17:06:44,762 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_unregister [2022-11-25 17:06:44,763 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_release [2022-11-25 17:06:44,763 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 17:06:44,766 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_unregister [2022-11-25 17:06:44,766 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_release [2022-11-25 17:06:44,768 WARN L623 FunctionHandler]: Unknown extern function platform_driver_register [2022-11-25 17:06:44,769 WARN L623 FunctionHandler]: Unknown extern function platform_driver_unregister [2022-11-25 17:06:44,777 WARN L623 FunctionHandler]: Unknown extern function ldv_check_final_state [2022-11-25 17:06:44,781 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_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/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-11-25 17:06:44,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:06:44,819 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:06:44,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44 WrapperNode [2022-11-25 17:06:44,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:06:44,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:06:44,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:06:44,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:06:44,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44" (1/1) ... [2022-11-25 17:06:44,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44" (1/1) ... [2022-11-25 17:06:44,906 INFO L138 Inliner]: procedures = 83, calls = 168, calls flagged for inlining = 31, calls inlined = 25, statements flattened = 527 [2022-11-25 17:06:44,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:06:44,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:06:44,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:06:44,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:06:44,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44" (1/1) ... [2022-11-25 17:06:44,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44" (1/1) ... [2022-11-25 17:06:44,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44" (1/1) ... [2022-11-25 17:06:44,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44" (1/1) ... [2022-11-25 17:06:44,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44" (1/1) ... [2022-11-25 17:06:44,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44" (1/1) ... [2022-11-25 17:06:44,962 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44" (1/1) ... [2022-11-25 17:06:44,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44" (1/1) ... [2022-11-25 17:06:44,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:06:44,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:06:44,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:06:44,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:06:44,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44" (1/1) ... [2022-11-25 17:06:44,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:06:44,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:45,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:06:45,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:06:45,078 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2022-11-25 17:06:45,079 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2022-11-25 17:06:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_probe [2022-11-25 17:06:45,080 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_probe [2022-11-25 17:06:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:06:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-25 17:06:45,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-25 17:06:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:06:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 17:06:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-25 17:06:45,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-25 17:06:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:06:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-25 17:06:45,083 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-25 17:06:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 17:06:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-11-25 17:06:45,084 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-11-25 17:06:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-25 17:06:45,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-25 17:06:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-25 17:06:45,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-25 17:06:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2022-11-25 17:06:45,087 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2022-11-25 17:06:45,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:06:45,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 17:06:45,088 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-11-25 17:06:45,088 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-11-25 17:06:45,088 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2022-11-25 17:06:45,088 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2022-11-25 17:06:45,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:06:45,089 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2022-11-25 17:06:45,089 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2022-11-25 17:06:45,089 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 17:06:45,089 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 17:06:45,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:06:45,090 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove [2022-11-25 17:06:45,090 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove [2022-11-25 17:06:45,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:06:45,091 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-11-25 17:06:45,091 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-11-25 17:06:45,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:06:45,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:06:45,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2022-11-25 17:06:45,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2022-11-25 17:06:45,092 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-11-25 17:06:45,092 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-11-25 17:06:45,459 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:06:45,462 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:06:45,920 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-25 17:06:46,267 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:06:46,278 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:06:46,278 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 17:06:46,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:06:46 BoogieIcfgContainer [2022-11-25 17:06:46,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:06:46,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:06:46,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:06:46,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:06:46,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:06:44" (1/3) ... [2022-11-25 17:06:46,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4a39db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:06:46, skipping insertion in model container [2022-11-25 17:06:46,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:44" (2/3) ... [2022-11-25 17:06:46,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4a39db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:06:46, skipping insertion in model container [2022-11-25 17:06:46,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:06:46" (3/3) ... [2022-11-25 17:06:46,292 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-11-25 17:06:46,316 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:06:46,317 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-25 17:06:46,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:06:46,390 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;@1974459b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:06:46,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 17:06:46,404 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-11-25 17:06:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 17:06:46,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:46,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:46,422 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-11-25 17:06:46,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:46,429 INFO L85 PathProgramCache]: Analyzing trace with hash 165870401, now seen corresponding path program 1 times [2022-11-25 17:06:46,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:46,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773942460] [2022-11-25 17:06:46,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:46,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:46,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 17:06:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:46,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:46,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773942460] [2022-11-25 17:06:46,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773942460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:46,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:46,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:06:46,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758515148] [2022-11-25 17:06:46,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:46,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:06:46,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:46,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:06:46,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:06:46,991 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-11-25 17:06:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:47,780 INFO L93 Difference]: Finished difference Result 518 states and 680 transitions. [2022-11-25 17:06:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:06:47,783 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-11-25 17:06:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:47,806 INFO L225 Difference]: With dead ends: 518 [2022-11-25 17:06:47,806 INFO L226 Difference]: Without dead ends: 262 [2022-11-25 17:06:47,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:06:47,825 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 95 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:47,832 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.6s Time] [2022-11-25 17:06:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-25 17:06:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 239. [2022-11-25 17:06:47,924 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-11-25 17:06:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 302 transitions. [2022-11-25 17:06:47,928 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 302 transitions. Word has length 16 [2022-11-25 17:06:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:47,928 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 302 transitions. [2022-11-25 17:06:47,929 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-11-25 17:06:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 302 transitions. [2022-11-25 17:06:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 17:06:47,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:47,934 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-11-25 17:06:47,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:06:47,935 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-11-25 17:06:47,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:47,938 INFO L85 PathProgramCache]: Analyzing trace with hash -11803947, now seen corresponding path program 1 times [2022-11-25 17:06:47,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:47,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061446035] [2022-11-25 17:06:47,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:47,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:48,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:06:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:06:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:48,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:06:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:06:48,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:48,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061446035] [2022-11-25 17:06:48,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061446035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:48,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:48,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:06:48,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581167977] [2022-11-25 17:06:48,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:48,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:06:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:06:48,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:06:48,302 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-11-25 17:06:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:49,344 INFO L93 Difference]: Finished difference Result 521 states and 667 transitions. [2022-11-25 17:06:49,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:06:49,345 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-11-25 17:06:49,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:49,355 INFO L225 Difference]: With dead ends: 521 [2022-11-25 17:06:49,355 INFO L226 Difference]: Without dead ends: 515 [2022-11-25 17:06:49,356 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-11-25 17:06:49,357 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 324 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:49,357 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.9s Time] [2022-11-25 17:06:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-11-25 17:06:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 459. [2022-11-25 17:06:49,430 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-11-25 17:06:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 595 transitions. [2022-11-25 17:06:49,436 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 595 transitions. Word has length 40 [2022-11-25 17:06:49,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:49,436 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 595 transitions. [2022-11-25 17:06:49,437 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-11-25 17:06:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 595 transitions. [2022-11-25 17:06:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 17:06:49,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:49,448 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-11-25 17:06:49,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:06:49,449 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-11-25 17:06:49,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:49,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2035530627, now seen corresponding path program 1 times [2022-11-25 17:06:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:49,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618053104] [2022-11-25 17:06:49,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:49,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:49,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:06:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:06:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:06:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 17:06:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 17:06:49,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:49,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618053104] [2022-11-25 17:06:49,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618053104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:49,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:49,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:06:49,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990265484] [2022-11-25 17:06:49,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:49,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:06:49,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:49,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:06:49,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:06:49,677 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-11-25 17:06:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:50,465 INFO L93 Difference]: Finished difference Result 1167 states and 1505 transitions. [2022-11-25 17:06:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:06:50,466 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-11-25 17:06:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:50,470 INFO L225 Difference]: With dead ends: 1167 [2022-11-25 17:06:50,470 INFO L226 Difference]: Without dead ends: 711 [2022-11-25 17:06:50,472 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-11-25 17:06:50,473 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 185 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:50,473 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.7s Time] [2022-11-25 17:06:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-11-25 17:06:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 625. [2022-11-25 17:06:50,519 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-11-25 17:06:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 791 transitions. [2022-11-25 17:06:50,522 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 791 transitions. Word has length 54 [2022-11-25 17:06:50,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:50,523 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 791 transitions. [2022-11-25 17:06:50,523 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-11-25 17:06:50,523 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 791 transitions. [2022-11-25 17:06:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 17:06:50,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:50,525 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-11-25 17:06:50,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:06:50,525 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-11-25 17:06:50,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash 622072863, now seen corresponding path program 1 times [2022-11-25 17:06:50,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:50,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585480010] [2022-11-25 17:06:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:50,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:50,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:06:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:50,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:06:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:50,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:06:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:50,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:50,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 17:06:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:50,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 17:06:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:50,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:50,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:06:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 17:06:50,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:50,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585480010] [2022-11-25 17:06:50,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585480010] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:06:50,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138929860] [2022-11-25 17:06:50,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:50,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:50,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:50,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:50,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:06:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:51,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:06:51,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:06:51,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:06:51,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138929860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:51,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:06:51,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-25 17:06:51,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594363443] [2022-11-25 17:06:51,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:51,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:06:51,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:51,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:06:51,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:06:51,206 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-11-25 17:06:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:51,299 INFO L93 Difference]: Finished difference Result 1332 states and 1692 transitions. [2022-11-25 17:06:51,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:06:51,300 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-11-25 17:06:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:51,304 INFO L225 Difference]: With dead ends: 1332 [2022-11-25 17:06:51,304 INFO L226 Difference]: Without dead ends: 710 [2022-11-25 17:06:51,306 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-11-25 17:06:51,307 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-11-25 17:06:51,308 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-11-25 17:06:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-25 17:06:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 698. [2022-11-25 17:06:51,350 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-11-25 17:06:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 896 transitions. [2022-11-25 17:06:51,354 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 896 transitions. Word has length 66 [2022-11-25 17:06:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:51,354 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 896 transitions. [2022-11-25 17:06:51,355 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-11-25 17:06:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 896 transitions. [2022-11-25 17:06:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 17:06:51,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:51,357 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-11-25 17:06:51,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:06:51,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-25 17:06:51,564 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-11-25 17:06:51,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1434225425, now seen corresponding path program 1 times [2022-11-25 17:06:51,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:51,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352644521] [2022-11-25 17:06:51,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:51,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:51,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:06:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:51,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:06:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:51,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:06:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:51,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 17:06:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:51,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:51,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 17:06:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:51,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 17:06:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:51,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:51,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:06:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 17:06:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:51,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352644521] [2022-11-25 17:06:51,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352644521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:51,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:51,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:06:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553249055] [2022-11-25 17:06:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:51,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:06:51,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:06:51,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:06:51,826 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-11-25 17:06:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:52,274 INFO L93 Difference]: Finished difference Result 1270 states and 1646 transitions. [2022-11-25 17:06:52,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:06:52,275 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-11-25 17:06:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:52,283 INFO L225 Difference]: With dead ends: 1270 [2022-11-25 17:06:52,283 INFO L226 Difference]: Without dead ends: 764 [2022-11-25 17:06:52,285 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-11-25 17:06:52,287 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 124 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:52,287 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.4s Time] [2022-11-25 17:06:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-11-25 17:06:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 706. [2022-11-25 17:06:52,380 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-11-25 17:06:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 906 transitions. [2022-11-25 17:06:52,387 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 906 transitions. Word has length 81 [2022-11-25 17:06:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:52,389 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 906 transitions. [2022-11-25 17:06:52,389 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-11-25 17:06:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 906 transitions. [2022-11-25 17:06:52,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-25 17:06:52,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:52,392 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-11-25 17:06:52,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:06:52,394 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-11-25 17:06:52,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash -21740282, now seen corresponding path program 1 times [2022-11-25 17:06:52,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:52,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775029853] [2022-11-25 17:06:52,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:52,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:52,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:06:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:52,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:06:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:52,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 17:06:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:52,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 17:06:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:52,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:52,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 17:06:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:52,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:06:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:52,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:06:52,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:52,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775029853] [2022-11-25 17:06:52,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775029853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:52,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:52,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:52,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710302808] [2022-11-25 17:06:52,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:52,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:06:52,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:52,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:06:52,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:06:52,585 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-11-25 17:06:52,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:52,928 INFO L93 Difference]: Finished difference Result 1539 states and 2014 transitions. [2022-11-25 17:06:52,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:06:52,928 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-11-25 17:06:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:52,933 INFO L225 Difference]: With dead ends: 1539 [2022-11-25 17:06:52,934 INFO L226 Difference]: Without dead ends: 836 [2022-11-25 17:06:52,936 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-11-25 17:06:52,937 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.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:52,937 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.3s Time] [2022-11-25 17:06:52,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-11-25 17:06:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 784. [2022-11-25 17:06:52,981 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-11-25 17:06:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1020 transitions. [2022-11-25 17:06:52,986 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1020 transitions. Word has length 84 [2022-11-25 17:06:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:52,986 INFO L495 AbstractCegarLoop]: Abstraction has 784 states and 1020 transitions. [2022-11-25 17:06:52,986 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-11-25 17:06:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1020 transitions. [2022-11-25 17:06:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-25 17:06:52,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:52,988 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-11-25 17:06:52,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:06:52,989 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-11-25 17:06:52,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1302579183, now seen corresponding path program 2 times [2022-11-25 17:06:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:52,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512063171] [2022-11-25 17:06:52,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:06:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:06:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:06:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 17:06:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 17:06:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:06:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:06:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:53,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512063171] [2022-11-25 17:06:53,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512063171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:53,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:53,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:06:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362286034] [2022-11-25 17:06:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:53,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:06:53,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:06:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:06:53,160 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-11-25 17:06:53,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:53,675 INFO L93 Difference]: Finished difference Result 1345 states and 1748 transitions. [2022-11-25 17:06:53,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:06:53,676 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-11-25 17:06:53,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:53,680 INFO L225 Difference]: With dead ends: 1345 [2022-11-25 17:06:53,680 INFO L226 Difference]: Without dead ends: 538 [2022-11-25 17:06:53,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:06:53,684 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 279 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:53,684 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.4s Time] [2022-11-25 17:06:53,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-11-25 17:06:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 505. [2022-11-25 17:06:53,717 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-11-25 17:06:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 637 transitions. [2022-11-25 17:06:53,720 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 637 transitions. Word has length 78 [2022-11-25 17:06:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:53,721 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 637 transitions. [2022-11-25 17:06:53,722 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-11-25 17:06:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 637 transitions. [2022-11-25 17:06:53,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 17:06:53,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:53,732 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-11-25 17:06:53,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:06:53,733 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-11-25 17:06:53,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:53,733 INFO L85 PathProgramCache]: Analyzing trace with hash -456742297, now seen corresponding path program 1 times [2022-11-25 17:06:53,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:53,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124139532] [2022-11-25 17:06:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:06:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:06:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 17:06:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 17:06:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 17:06:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:06:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:06:53,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:53,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124139532] [2022-11-25 17:06:53,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124139532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:06:53,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067035771] [2022-11-25 17:06:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:53,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:53,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:53,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:54,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:06:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:54,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:06:54,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:06:54,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:06:54,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067035771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:54,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:06:54,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-25 17:06:54,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593408717] [2022-11-25 17:06:54,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:54,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:06:54,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:54,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:06:54,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:06:54,348 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-11-25 17:06:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:54,456 INFO L93 Difference]: Finished difference Result 988 states and 1250 transitions. [2022-11-25 17:06:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:06:54,457 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-11-25 17:06:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:54,460 INFO L225 Difference]: With dead ends: 988 [2022-11-25 17:06:54,461 INFO L226 Difference]: Without dead ends: 508 [2022-11-25 17:06:54,462 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-11-25 17:06:54,463 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:54,463 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.1s Time] [2022-11-25 17:06:54,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-11-25 17:06:54,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 504. [2022-11-25 17:06:54,504 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-11-25 17:06:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 633 transitions. [2022-11-25 17:06:54,508 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 633 transitions. Word has length 89 [2022-11-25 17:06:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:54,508 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 633 transitions. [2022-11-25 17:06:54,508 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-11-25 17:06:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 633 transitions. [2022-11-25 17:06:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-25 17:06:54,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:54,511 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-11-25 17:06:54,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:06:54,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:54,718 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-11-25 17:06:54,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:54,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1274109137, now seen corresponding path program 1 times [2022-11-25 17:06:54,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:54,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182416270] [2022-11-25 17:06:54,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:54,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:54,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:06:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:54,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:06:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:54,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 17:06:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:54,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 17:06:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:54,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:54,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 17:06:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:54,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:06:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:54,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:06:54,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:54,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182416270] [2022-11-25 17:06:54,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182416270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:06:54,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570543448] [2022-11-25 17:06:54,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:54,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:54,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:54,913 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:54,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:06:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:55,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:06:55,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:06:55,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:55,287 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:06:55,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570543448] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:55,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:06:55,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-11-25 17:06:55,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565658155] [2022-11-25 17:06:55,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:55,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:06:55,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:55,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:06:55,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:06:55,292 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-11-25 17:06:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:55,711 INFO L93 Difference]: Finished difference Result 621 states and 801 transitions. [2022-11-25 17:06:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:06:55,712 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-11-25 17:06:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:55,715 INFO L225 Difference]: With dead ends: 621 [2022-11-25 17:06:55,715 INFO L226 Difference]: Without dead ends: 618 [2022-11-25 17:06:55,716 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-11-25 17:06:55,718 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 343 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:55,719 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.4s Time] [2022-11-25 17:06:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-11-25 17:06:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 497. [2022-11-25 17:06:55,750 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-11-25 17:06:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 623 transitions. [2022-11-25 17:06:55,753 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 623 transitions. Word has length 90 [2022-11-25 17:06:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:55,754 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 623 transitions. [2022-11-25 17:06:55,754 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-11-25 17:06:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 623 transitions. [2022-11-25 17:06:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-25 17:06:55,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:55,756 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-11-25 17:06:55,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:06:55,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:55,964 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-11-25 17:06:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1107796325, now seen corresponding path program 1 times [2022-11-25 17:06:55,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:55,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850056433] [2022-11-25 17:06:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:06:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:06:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:06:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 17:06:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 17:06:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 17:06:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:06:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:06:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:06:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 17:06:56,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:56,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850056433] [2022-11-25 17:06:56,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850056433] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:06:56,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091339117] [2022-11-25 17:06:56,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:56,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:56,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:56,154 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:56,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:06:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:56,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:06:56,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-25 17:06:56,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:06:56,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091339117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:56,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:06:56,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-11-25 17:06:56,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864097536] [2022-11-25 17:06:56,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:56,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:06:56,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:56,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:06:56,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:06:56,426 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-11-25 17:06:56,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:56,541 INFO L93 Difference]: Finished difference Result 1169 states and 1463 transitions. [2022-11-25 17:06:56,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:06:56,543 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-11-25 17:06:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:56,547 INFO L225 Difference]: With dead ends: 1169 [2022-11-25 17:06:56,548 INFO L226 Difference]: Without dead ends: 883 [2022-11-25 17:06:56,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:06:56,551 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-11-25 17:06:56,552 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-11-25 17:06:56,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-11-25 17:06:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 691. [2022-11-25 17:06:56,621 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-11-25 17:06:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 869 transitions. [2022-11-25 17:06:56,625 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 869 transitions. Word has length 96 [2022-11-25 17:06:56,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:56,626 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 869 transitions. [2022-11-25 17:06:56,626 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-11-25 17:06:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 869 transitions. [2022-11-25 17:06:56,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-25 17:06:56,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:56,629 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-11-25 17:06:56,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:06:56,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 17:06:56,836 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-11-25 17:06:56,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:56,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1916421667, now seen corresponding path program 1 times [2022-11-25 17:06:56,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:56,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015618259] [2022-11-25 17:06:56,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:56,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:06:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:06:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 17:06:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 17:06:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 17:06:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:06:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 17:06:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:06:57,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:57,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015618259] [2022-11-25 17:06:57,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015618259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:57,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:57,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:57,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145702750] [2022-11-25 17:06:57,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:57,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:06:57,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:57,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:06:57,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:06:57,174 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-11-25 17:06:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:57,735 INFO L93 Difference]: Finished difference Result 1413 states and 1794 transitions. [2022-11-25 17:06:57,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:06:57,736 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-11-25 17:06:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:57,742 INFO L225 Difference]: With dead ends: 1413 [2022-11-25 17:06:57,743 INFO L226 Difference]: Without dead ends: 1411 [2022-11-25 17:06:57,743 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-11-25 17:06:57,744 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 300 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:57,744 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.4s Time] [2022-11-25 17:06:57,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-11-25 17:06:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1343. [2022-11-25 17:06:57,843 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-11-25 17:06:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1707 transitions. [2022-11-25 17:06:57,850 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1707 transitions. Word has length 96 [2022-11-25 17:06:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:57,851 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1707 transitions. [2022-11-25 17:06:57,851 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-11-25 17:06:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1707 transitions. [2022-11-25 17:06:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-25 17:06:57,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:57,854 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-11-25 17:06:57,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:06:57,854 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-11-25 17:06:57,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1408694220, now seen corresponding path program 1 times [2022-11-25 17:06:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:57,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785481008] [2022-11-25 17:06:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:57,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:06:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:06:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:06:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 17:06:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 17:06:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 17:06:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:06:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-25 17:06:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:06:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 17:06:58,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:58,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785481008] [2022-11-25 17:06:58,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785481008] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:06:58,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709351486] [2022-11-25 17:06:58,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:58,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:58,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:58,032 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:58,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:06:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:06:58,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-25 17:06:58,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:06:58,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709351486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:58,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:06:58,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-11-25 17:06:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057300691] [2022-11-25 17:06:58,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:58,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:06:58,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:58,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:06:58,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:06:58,322 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-11-25 17:06:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:58,572 INFO L93 Difference]: Finished difference Result 2695 states and 3414 transitions. [2022-11-25 17:06:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:06:58,573 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-11-25 17:06:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:58,583 INFO L225 Difference]: With dead ends: 2695 [2022-11-25 17:06:58,583 INFO L226 Difference]: Without dead ends: 2125 [2022-11-25 17:06:58,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:06:58,587 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-11-25 17:06:58,587 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-11-25 17:06:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2022-11-25 17:06:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1343. [2022-11-25 17:06:58,712 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-11-25 17:06:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1707 transitions. [2022-11-25 17:06:58,720 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1707 transitions. Word has length 100 [2022-11-25 17:06:58,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:58,721 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1707 transitions. [2022-11-25 17:06:58,721 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-11-25 17:06:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1707 transitions. [2022-11-25 17:06:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-25 17:06:58,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:58,724 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-11-25 17:06:58,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:06:58,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 17:06:58,935 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-11-25 17:06:58,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:58,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1458291270, now seen corresponding path program 1 times [2022-11-25 17:06:58,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:58,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117529307] [2022-11-25 17:06:58,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:58,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:06:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:06:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 17:06:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 17:06:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 17:06:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 17:06:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-25 17:06:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:06:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 17:06:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 17:06:59,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:59,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117529307] [2022-11-25 17:06:59,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117529307] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:06:59,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187286777] [2022-11-25 17:06:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:59,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:59,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:59,515 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:59,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:06:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:06:59,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:07:00,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:00,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187286777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:00,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:07:00,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2022-11-25 17:07:00,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461061129] [2022-11-25 17:07:00,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:00,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:07:00,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:00,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:07:00,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:07:00,359 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-11-25 17:07:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:00,818 INFO L93 Difference]: Finished difference Result 1361 states and 1716 transitions. [2022-11-25 17:07:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:07:00,819 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-11-25 17:07:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:00,823 INFO L225 Difference]: With dead ends: 1361 [2022-11-25 17:07:00,823 INFO L226 Difference]: Without dead ends: 677 [2022-11-25 17:07:00,826 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-11-25 17:07:00,827 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 260 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:00,827 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.3s Time] [2022-11-25 17:07:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-11-25 17:07:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2022-11-25 17:07:00,899 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-11-25 17:07:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 848 transitions. [2022-11-25 17:07:00,903 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 848 transitions. Word has length 115 [2022-11-25 17:07:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:00,904 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 848 transitions. [2022-11-25 17:07:00,904 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-11-25 17:07:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 848 transitions. [2022-11-25 17:07:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-25 17:07:00,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:00,907 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-11-25 17:07:00,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:01,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 17:07:01,114 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-11-25 17:07:01,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:01,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2060624510, now seen corresponding path program 1 times [2022-11-25 17:07:01,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:01,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642938451] [2022-11-25 17:07:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:01,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:07:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:07:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:07:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:07:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:07:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:07:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-25 17:07:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-25 17:07:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:07:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 17:07:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:07:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-25 17:07:01,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:01,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642938451] [2022-11-25 17:07:01,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642938451] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:01,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547192250] [2022-11-25 17:07:01,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:01,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:01,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:01,418 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:01,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:07:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:07:01,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-25 17:07:01,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:01,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547192250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:01,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:07:01,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-25 17:07:01,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259648073] [2022-11-25 17:07:01,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:01,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:07:01,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:01,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:07:01,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:07:01,752 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-11-25 17:07:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:01,833 INFO L93 Difference]: Finished difference Result 677 states and 848 transitions. [2022-11-25 17:07:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:07:01,833 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-11-25 17:07:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:01,837 INFO L225 Difference]: With dead ends: 677 [2022-11-25 17:07:01,837 INFO L226 Difference]: Without dead ends: 676 [2022-11-25 17:07:01,838 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-11-25 17:07:01,839 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-11-25 17:07:01,839 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-11-25 17:07:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-25 17:07:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2022-11-25 17:07:01,936 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-11-25 17:07:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 847 transitions. [2022-11-25 17:07:01,939 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 847 transitions. Word has length 129 [2022-11-25 17:07:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:01,940 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 847 transitions. [2022-11-25 17:07:01,940 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-11-25 17:07:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 847 transitions. [2022-11-25 17:07:01,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-25 17:07:01,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:01,944 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-11-25 17:07:01,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:02,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 17:07:02,152 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-11-25 17:07:02,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:02,153 INFO L85 PathProgramCache]: Analyzing trace with hash -545149392, now seen corresponding path program 1 times [2022-11-25 17:07:02,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:02,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362527292] [2022-11-25 17:07:02,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:02,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:07:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:07:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:07:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:07:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:07:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:07:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-25 17:07:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-25 17:07:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:07:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 17:07:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:07:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-25 17:07:02,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:02,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362527292] [2022-11-25 17:07:02,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362527292] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:02,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399480585] [2022-11-25 17:07:02,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:02,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:02,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:02,403 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:02,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:07:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:02,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:07:02,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-25 17:07:02,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-25 17:07:02,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399480585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:02,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:07:02,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-25 17:07:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659034018] [2022-11-25 17:07:02,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:02,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:07:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:02,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:07:02,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:07:02,838 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-11-25 17:07:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:03,618 INFO L93 Difference]: Finished difference Result 739 states and 937 transitions. [2022-11-25 17:07:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:07:03,619 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-11-25 17:07:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:03,624 INFO L225 Difference]: With dead ends: 739 [2022-11-25 17:07:03,624 INFO L226 Difference]: Without dead ends: 738 [2022-11-25 17:07:03,625 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-11-25 17:07:03,626 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 161 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:03,626 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.6s Time] [2022-11-25 17:07:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-11-25 17:07:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 672. [2022-11-25 17:07:03,724 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-11-25 17:07:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 842 transitions. [2022-11-25 17:07:03,728 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 842 transitions. Word has length 130 [2022-11-25 17:07:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:03,728 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 842 transitions. [2022-11-25 17:07:03,729 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-11-25 17:07:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 842 transitions. [2022-11-25 17:07:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-25 17:07:03,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:03,732 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-11-25 17:07:03,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:03,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 17:07:03,939 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-11-25 17:07:03,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:03,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1741917965, now seen corresponding path program 1 times [2022-11-25 17:07:03,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:03,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637649522] [2022-11-25 17:07:03,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:03,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:07:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:07:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:07:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:07:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:07:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 17:07:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 17:07:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:07:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:07:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 17:07:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 17:07:04,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:04,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637649522] [2022-11-25 17:07:04,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637649522] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:04,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427255107] [2022-11-25 17:07:04,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:04,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:04,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:04,202 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:04,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:07:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:07:04,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 17:07:04,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:04,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427255107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:04,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:07:04,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-25 17:07:04,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631964284] [2022-11-25 17:07:04,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:04,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:07:04,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:04,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:07:04,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:07:04,740 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-11-25 17:07:04,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:04,969 INFO L93 Difference]: Finished difference Result 672 states and 842 transitions. [2022-11-25 17:07:04,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:07:04,970 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-11-25 17:07:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:04,974 INFO L225 Difference]: With dead ends: 672 [2022-11-25 17:07:04,974 INFO L226 Difference]: Without dead ends: 670 [2022-11-25 17:07:04,975 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-11-25 17:07:04,976 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.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:04,976 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.2s Time] [2022-11-25 17:07:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-11-25 17:07:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2022-11-25 17:07:05,050 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-11-25 17:07:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 840 transitions. [2022-11-25 17:07:05,054 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 840 transitions. Word has length 131 [2022-11-25 17:07:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:05,055 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 840 transitions. [2022-11-25 17:07:05,055 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-11-25 17:07:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 840 transitions. [2022-11-25 17:07:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-25 17:07:05,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:05,059 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-11-25 17:07:05,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-25 17:07:05,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 17:07:05,266 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-11-25 17:07:05,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:05,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1835118270, now seen corresponding path program 1 times [2022-11-25 17:07:05,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:05,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514327097] [2022-11-25 17:07:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:05,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:07:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:07:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:07:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:07:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:07:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 17:07:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 17:07:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:07:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:07:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:07:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 17:07:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 17:07:05,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:05,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514327097] [2022-11-25 17:07:05,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514327097] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:05,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306524460] [2022-11-25 17:07:05,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:05,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:05,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:05,541 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:05,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:07:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:05,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:07:05,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 17:07:06,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 17:07:06,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306524460] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:06,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:07:06,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-25 17:07:06,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516680935] [2022-11-25 17:07:06,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:06,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:07:06,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:06,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:07:06,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:07:06,195 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-11-25 17:07:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:07,194 INFO L93 Difference]: Finished difference Result 696 states and 875 transitions. [2022-11-25 17:07:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:07:07,195 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-11-25 17:07:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:07,196 INFO L225 Difference]: With dead ends: 696 [2022-11-25 17:07:07,196 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 17:07:07,198 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-11-25 17:07:07,199 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 649 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:07,199 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.8s Time] [2022-11-25 17:07:07,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 17:07:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 17:07:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 17:07:07,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2022-11-25 17:07:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:07,201 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:07:07,201 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-11-25 17:07:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 17:07:07,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 17:07:07,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2022-11-25 17:07:07,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2022-11-25 17:07:07,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2022-11-25 17:07:07,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2022-11-25 17:07:07,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2022-11-25 17:07:07,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2022-11-25 17:07:07,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2022-11-25 17:07:07,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2022-11-25 17:07:07,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2022-11-25 17:07:07,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2022-11-25 17:07:07,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2022-11-25 17:07:07,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2022-11-25 17:07:07,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2022-11-25 17:07:07,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2022-11-25 17:07:07,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2022-11-25 17:07:07,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2022-11-25 17:07:07,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:07,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:07,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 17:07:15,672 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_rawENTRY(lines 940 945) the Hoare annotation is: true [2022-11-25 17:07:15,673 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawFINAL(lines 940 945) no Hoare annotation was computed. [2022-11-25 17:07:15,673 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawEXIT(lines 940 945) no Hoare annotation was computed. [2022-11-25 17:07:15,674 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_probeENTRY(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-11-25 17:07:15,674 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-11-25 17:07:15,674 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-11-25 17:07:15,674 INFO L899 garLoopResultBuilder]: For program point L1076-1(line 1076) no Hoare annotation was computed. [2022-11-25 17:07:15,678 INFO L895 garLoopResultBuilder]: At program point L1456(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-11-25 17:07:15,678 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeFINAL(lines 1040 1149) no Hoare annotation was computed. [2022-11-25 17:07:15,679 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-11-25 17:07:15,679 INFO L895 garLoopResultBuilder]: At program point L837(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-11-25 17:07:15,679 INFO L899 garLoopResultBuilder]: For program point L1118(line 1118) no Hoare annotation was computed. [2022-11-25 17:07:15,679 INFO L899 garLoopResultBuilder]: For program point L1118-1(line 1118) no Hoare annotation was computed. [2022-11-25 17:07:15,680 INFO L895 garLoopResultBuilder]: At program point L1135(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-11-25 17:07:15,680 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1122) no Hoare annotation was computed. [2022-11-25 17:07:15,680 INFO L895 garLoopResultBuilder]: At program point L937(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-11-25 17:07:15,681 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-11-25 17:07:15,681 INFO L899 garLoopResultBuilder]: For program point L1507-1(line 1507) no Hoare annotation was computed. [2022-11-25 17:07:15,682 INFO L895 garLoopResultBuilder]: At program point L1507-2(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-11-25 17:07:15,682 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 838) no Hoare annotation was computed. [2022-11-25 17:07:15,682 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-25 17:07:15,682 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-11-25 17:07:15,682 INFO L899 garLoopResultBuilder]: For program point L1144-1(line 1144) no Hoare annotation was computed. [2022-11-25 17:07:15,683 INFO L899 garLoopResultBuilder]: For program point L1103(lines 1103 1107) no Hoare annotation was computed. [2022-11-25 17:07:15,683 INFO L899 garLoopResultBuilder]: For program point L1103-2(lines 1103 1107) no Hoare annotation was computed. [2022-11-25 17:07:15,683 INFO L895 garLoopResultBuilder]: At program point L1128(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-11-25 17:07:15,683 INFO L895 garLoopResultBuilder]: At program point L1029(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-11-25 17:07:15,683 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-11-25 17:07:15,684 INFO L899 garLoopResultBuilder]: For program point L1087-1(line 1087) no Hoare annotation was computed. [2022-11-25 17:07:15,684 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-11-25 17:07:15,684 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1132) no Hoare annotation was computed. [2022-11-25 17:07:15,684 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-11-25 17:07:15,684 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2022-11-25 17:07:15,684 INFO L899 garLoopResultBuilder]: For program point L1352-1(line 1352) no Hoare annotation was computed. [2022-11-25 17:07:15,685 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeEXIT(lines 1040 1149) no Hoare annotation was computed. [2022-11-25 17:07:15,685 INFO L899 garLoopResultBuilder]: For program point L1121(line 1121) no Hoare annotation was computed. [2022-11-25 17:07:15,685 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1094) no Hoare annotation was computed. [2022-11-25 17:07:15,685 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-11-25 17:07:15,685 INFO L899 garLoopResultBuilder]: For program point L1344-1(line 1344) no Hoare annotation was computed. [2022-11-25 17:07:15,685 INFO L899 garLoopResultBuilder]: For program point L1022(lines 1022 1026) no Hoare annotation was computed. [2022-11-25 17:07:15,685 INFO L899 garLoopResultBuilder]: For program point L1014(lines 1014 1028) no Hoare annotation was computed. [2022-11-25 17:07:15,686 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1122) no Hoare annotation was computed. [2022-11-25 17:07:15,686 INFO L899 garLoopResultBuilder]: For program point L1014-1(lines 1014 1028) no Hoare annotation was computed. [2022-11-25 17:07:15,686 INFO L895 garLoopResultBuilder]: At program point L1361(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-11-25 17:07:15,686 INFO L895 garLoopResultBuilder]: At program point L907(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-11-25 17:07:15,686 INFO L895 garLoopResultBuilder]: At program point L1353(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-11-25 17:07:15,686 INFO L899 garLoopResultBuilder]: For program point L1122(line 1122) no Hoare annotation was computed. [2022-11-25 17:07:15,687 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-11-25 17:07:15,687 INFO L895 garLoopResultBuilder]: At program point L1345(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-11-25 17:07:15,687 INFO L899 garLoopResultBuilder]: For program point L1056(lines 1056 1060) no Hoare annotation was computed. [2022-11-25 17:07:15,687 INFO L899 garLoopResultBuilder]: For program point L833-1(line 833) no Hoare annotation was computed. [2022-11-25 17:07:15,688 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-11-25 17:07:15,688 INFO L899 garLoopResultBuilder]: For program point L1023-1(line 1023) no Hoare annotation was computed. [2022-11-25 17:07:15,688 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-11-25 17:07:15,688 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-11-25 17:07:15,689 INFO L899 garLoopResultBuilder]: For program point L1073-1(line 1073) no Hoare annotation was computed. [2022-11-25 17:07:15,689 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-11-25 17:07:15,689 INFO L895 garLoopResultBuilder]: At program point L1123(lines 1115 1129) 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-11-25 17:07:15,689 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-11-25 17:07:15,689 INFO L899 garLoopResultBuilder]: For program point L1090-1(line 1090) no Hoare annotation was computed. [2022-11-25 17:07:15,690 INFO L895 garLoopResultBuilder]: At program point L1470(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-11-25 17:07:15,690 INFO L899 garLoopResultBuilder]: For program point L1115(lines 1115 1130) no Hoare annotation was computed. [2022-11-25 17:07:15,690 INFO L899 garLoopResultBuilder]: For program point L1082(lines 1082 1085) no Hoare annotation was computed. [2022-11-25 17:07:15,690 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-11-25 17:07:15,690 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2022-11-25 17:07:15,690 INFO L899 garLoopResultBuilder]: For program point L1074(lines 1074 1080) no Hoare annotation was computed. [2022-11-25 17:07:15,691 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1132) no Hoare annotation was computed. [2022-11-25 17:07:15,691 INFO L899 garLoopResultBuilder]: For program point L1132(line 1132) no Hoare annotation was computed. [2022-11-25 17:07:15,691 INFO L899 garLoopResultBuilder]: For program point L1099(lines 1099 1102) no Hoare annotation was computed. [2022-11-25 17:07:15,691 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-11-25 17:07:15,691 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-11-25 17:07:15,692 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-25 17:07:15,692 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-11-25 17:07:15,692 INFO L899 garLoopResultBuilder]: For program point L1108(lines 1108 1112) no Hoare annotation was computed. [2022-11-25 17:07:15,692 INFO L899 garLoopResultBuilder]: For program point L1009(lines 1009 1013) no Hoare annotation was computed. [2022-11-25 17:07:15,692 INFO L895 garLoopResultBuilder]: At program point L1133(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 (= ~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-11-25 17:07:15,692 INFO L899 garLoopResultBuilder]: For program point L1513(lines 1513 1515) no Hoare annotation was computed. [2022-11-25 17:07:15,693 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-11-25 17:07:15,693 INFO L899 garLoopResultBuilder]: For program point L1480-1(line 1480) no Hoare annotation was computed. [2022-11-25 17:07:15,693 INFO L895 garLoopResultBuilder]: At program point L1480-2(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-11-25 17:07:15,693 INFO L895 garLoopResultBuilder]: At program point L1125(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-11-25 17:07:15,693 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2022-11-25 17:07:15,694 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-11-25 17:07:15,694 INFO L899 garLoopResultBuilder]: For program point L836-2(line 836) no Hoare annotation was computed. [2022-11-25 17:07:15,694 INFO L895 garLoopResultBuilder]: At program point platform_get_drvdataENTRY(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-11-25 17:07:15,694 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataEXIT(lines 895 902) no Hoare annotation was computed. [2022-11-25 17:07:15,694 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-11-25 17:07:15,695 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataFINAL(lines 895 902) no Hoare annotation was computed. [2022-11-25 17:07:15,695 INFO L899 garLoopResultBuilder]: For program point L1463-1(line 1463) no Hoare annotation was computed. [2022-11-25 17:07:15,695 INFO L902 garLoopResultBuilder]: At program point L1463-2(lines 1462 1464) the Hoare annotation is: true [2022-11-25 17:07:15,695 INFO L902 garLoopResultBuilder]: At program point ldv_undef_intENTRY(lines 860 867) the Hoare annotation is: true [2022-11-25 17:07:15,695 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intFINAL(lines 860 867) no Hoare annotation was computed. [2022-11-25 17:07:15,695 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intEXIT(lines 860 867) no Hoare annotation was computed. [2022-11-25 17:07:15,696 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 1482 1484) no Hoare annotation was computed. [2022-11-25 17:07:15,696 INFO L902 garLoopResultBuilder]: At program point hwmon_device_unregisterENTRY(lines 1482 1484) the Hoare annotation is: true [2022-11-25 17:07:15,696 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 1482 1484) no Hoare annotation was computed. [2022-11-25 17:07:15,696 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 876 882) no Hoare annotation was computed. [2022-11-25 17:07:15,696 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 876 882) the Hoare annotation is: true [2022-11-25 17:07:15,696 INFO L895 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(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-11-25 17:07:15,697 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:07:15,697 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:07:15,697 INFO L902 garLoopResultBuilder]: At program point s3c_adc_releaseENTRY(lines 1509 1511) the Hoare annotation is: true [2022-11-25 17:07:15,697 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseEXIT(lines 1509 1511) no Hoare annotation was computed. [2022-11-25 17:07:15,697 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseFINAL(lines 1509 1511) no Hoare annotation was computed. [2022-11-25 17:07:15,697 INFO L899 garLoopResultBuilder]: For program point L801(line 801) no Hoare annotation was computed. [2022-11-25 17:07:15,697 INFO L899 garLoopResultBuilder]: For program point L801-2(lines 800 802) no Hoare annotation was computed. [2022-11-25 17:07:15,698 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 800 802) the Hoare annotation is: true [2022-11-25 17:07:15,698 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 800 802) no Hoare annotation was computed. [2022-11-25 17:07:15,698 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeFINAL(lines 1150 1173) no Hoare annotation was computed. [2022-11-25 17:07:15,698 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeEXIT(lines 1150 1173) no Hoare annotation was computed. [2022-11-25 17:07:15,698 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-11-25 17:07:15,699 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-11-25 17:07:15,699 INFO L899 garLoopResultBuilder]: For program point L1170-1(line 1170) no Hoare annotation was computed. [2022-11-25 17:07:15,699 INFO L899 garLoopResultBuilder]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2022-11-25 17:07:15,699 INFO L895 garLoopResultBuilder]: At program point L1166(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-11-25 17:07:15,699 INFO L895 garLoopResultBuilder]: At program point L1164(lines 1155 1172) 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-11-25 17:07:15,700 INFO L899 garLoopResultBuilder]: For program point L1163(line 1163) no Hoare annotation was computed. [2022-11-25 17:07:15,700 INFO L899 garLoopResultBuilder]: For program point L1162(line 1162) no Hoare annotation was computed. [2022-11-25 17:07:15,700 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_removeENTRY(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-11-25 17:07:15,700 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1163) no Hoare annotation was computed. [2022-11-25 17:07:15,700 INFO L902 garLoopResultBuilder]: At program point L1158(line 1158) the Hoare annotation is: true [2022-11-25 17:07:15,701 INFO L899 garLoopResultBuilder]: For program point L1158-1(line 1158) no Hoare annotation was computed. [2022-11-25 17:07:15,701 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-11-25 17:07:15,701 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1163) no Hoare annotation was computed. [2022-11-25 17:07:15,701 INFO L899 garLoopResultBuilder]: For program point L1156-1(line 1156) no Hoare annotation was computed. [2022-11-25 17:07:15,701 INFO L902 garLoopResultBuilder]: At program point L1400(lines 1397 1402) the Hoare annotation is: true [2022-11-25 17:07:15,701 INFO L899 garLoopResultBuilder]: For program point PTR_ERREXIT(lines 1324 1331) no Hoare annotation was computed. [2022-11-25 17:07:15,702 INFO L902 garLoopResultBuilder]: At program point PTR_ERRENTRY(lines 1324 1331) the Hoare annotation is: true [2022-11-25 17:07:15,702 INFO L899 garLoopResultBuilder]: For program point PTR_ERRFINAL(lines 1324 1331) no Hoare annotation was computed. [2022-11-25 17:07:15,702 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 1385 1390) no Hoare annotation was computed. [2022-11-25 17:07:15,702 INFO L902 garLoopResultBuilder]: At program point ldv_is_errENTRY(lines 1385 1390) the Hoare annotation is: true [2022-11-25 17:07:15,702 INFO L899 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 1385 1390) no Hoare annotation was computed. [2022-11-25 17:07:15,702 INFO L902 garLoopResultBuilder]: At program point L817(line 817) the Hoare annotation is: true [2022-11-25 17:07:15,703 INFO L902 garLoopResultBuilder]: At program point L818-1(line 818) the Hoare annotation is: true [2022-11-25 17:07:15,703 INFO L902 garLoopResultBuilder]: At program point L817-1(line 817) the Hoare annotation is: true [2022-11-25 17:07:15,703 INFO L899 garLoopResultBuilder]: For program point L818-2(line 818) no Hoare annotation was computed. [2022-11-25 17:07:15,703 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(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-11-25 17:07:15,703 INFO L899 garLoopResultBuilder]: For program point L812(lines 812 820) no Hoare annotation was computed. [2022-11-25 17:07:15,703 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 805 822) no Hoare annotation was computed. [2022-11-25 17:07:15,704 INFO L899 garLoopResultBuilder]: For program point L818(line 818) no Hoare annotation was computed. [2022-11-25 17:07:15,704 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 805 822) no Hoare annotation was computed. [2022-11-25 17:07:15,704 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 1476 1478) no Hoare annotation was computed. [2022-11-25 17:07:15,704 INFO L902 garLoopResultBuilder]: At program point device_remove_fileENTRY(lines 1476 1478) the Hoare annotation is: true [2022-11-25 17:07:15,704 INFO L899 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 1476 1478) no Hoare annotation was computed. [2022-11-25 17:07:15,704 INFO L899 garLoopResultBuilder]: For program point L1249(line 1249) no Hoare annotation was computed. [2022-11-25 17:07:15,705 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1254) no Hoare annotation was computed. [2022-11-25 17:07:15,705 INFO L899 garLoopResultBuilder]: For program point L1307(line 1307) no Hoare annotation was computed. [2022-11-25 17:07:15,705 INFO L895 garLoopResultBuilder]: At program point L1497(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-11-25 17:07:15,705 INFO L899 garLoopResultBuilder]: For program point L1233(line 1233) no Hoare annotation was computed. [2022-11-25 17:07:15,705 INFO L899 garLoopResultBuilder]: For program point L1291(lines 1291 1305) no Hoare annotation was computed. [2022-11-25 17:07:15,705 INFO L899 garLoopResultBuilder]: For program point L1283(lines 1283 1288) no Hoare annotation was computed. [2022-11-25 17:07:15,706 INFO L899 garLoopResultBuilder]: For program point L1250(lines 1250 1259) no Hoare annotation was computed. [2022-11-25 17:07:15,706 INFO L899 garLoopResultBuilder]: For program point L1250-1(lines 1236 1273) no Hoare annotation was computed. [2022-11-25 17:07:15,706 INFO L895 garLoopResultBuilder]: At program point L1217(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-11-25 17:07:15,706 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1242) no Hoare annotation was computed. [2022-11-25 17:07:15,706 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 17:07:15,706 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:07:15,707 INFO L902 garLoopResultBuilder]: At program point L1308(line 1308) the Hoare annotation is: true [2022-11-25 17:07:15,707 INFO L899 garLoopResultBuilder]: For program point L1242(line 1242) no Hoare annotation was computed. [2022-11-25 17:07:15,707 INFO L899 garLoopResultBuilder]: For program point L1242-1(line 1242) no Hoare annotation was computed. [2022-11-25 17:07:15,707 INFO L899 garLoopResultBuilder]: For program point L1234(lines 1234 1276) no Hoare annotation was computed. [2022-11-25 17:07:15,707 INFO L895 garLoopResultBuilder]: At program point L1317(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-11-25 17:07:15,707 INFO L895 garLoopResultBuilder]: At program point L1251(line 1251) the Hoare annotation is: false [2022-11-25 17:07:15,708 INFO L899 garLoopResultBuilder]: For program point L1251-1(line 1251) no Hoare annotation was computed. [2022-11-25 17:07:15,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1242) no Hoare annotation was computed. [2022-11-25 17:07:15,708 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2022-11-25 17:07:15,708 INFO L899 garLoopResultBuilder]: For program point L1252(lines 1252 1257) no Hoare annotation was computed. [2022-11-25 17:07:15,708 INFO L902 garLoopResultBuilder]: At program point L1500(lines 1499 1501) the Hoare annotation is: true [2022-11-25 17:07:15,708 INFO L899 garLoopResultBuilder]: For program point L1236(lines 1236 1273) no Hoare annotation was computed. [2022-11-25 17:07:15,709 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-11-25 17:07:15,709 INFO L899 garLoopResultBuilder]: For program point L1261-1(line 1261) no Hoare annotation was computed. [2022-11-25 17:07:15,709 INFO L899 garLoopResultBuilder]: For program point L1278(line 1278) no Hoare annotation was computed. [2022-11-25 17:07:15,709 INFO L899 garLoopResultBuilder]: For program point L1237(line 1237) no Hoare annotation was computed. [2022-11-25 17:07:15,709 INFO L902 garLoopResultBuilder]: At program point L1295(lines 1225 1322) the Hoare annotation is: true [2022-11-25 17:07:15,709 INFO L899 garLoopResultBuilder]: For program point L1262(lines 1262 1267) no Hoare annotation was computed. [2022-11-25 17:07:15,710 INFO L895 garLoopResultBuilder]: At program point L1452(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-11-25 17:07:15,710 INFO L899 garLoopResultBuilder]: For program point L1254(line 1254) no Hoare annotation was computed. [2022-11-25 17:07:15,710 INFO L899 garLoopResultBuilder]: For program point L1254-1(line 1254) no Hoare annotation was computed. [2022-11-25 17:07:15,710 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:07:15,710 INFO L899 garLoopResultBuilder]: For program point L1279(lines 1279 1312) no Hoare annotation was computed. [2022-11-25 17:07:15,710 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1264) no Hoare annotation was computed. [2022-11-25 17:07:15,711 INFO L899 garLoopResultBuilder]: For program point L1271(line 1271) no Hoare annotation was computed. [2022-11-25 17:07:15,711 INFO L899 garLoopResultBuilder]: For program point L1238(lines 1238 1247) no Hoare annotation was computed. [2022-11-25 17:07:15,711 INFO L902 garLoopResultBuilder]: At program point L1486(lines 1485 1487) the Hoare annotation is: true [2022-11-25 17:07:15,711 INFO L902 garLoopResultBuilder]: At program point L1321(lines 1220 1323) the Hoare annotation is: true [2022-11-25 17:07:15,711 INFO L902 garLoopResultBuilder]: At program point L1189(lines 1185 1191) the Hoare annotation is: true [2022-11-25 17:07:15,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:07:15,711 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-11-25 17:07:15,712 INFO L899 garLoopResultBuilder]: For program point L1214-1(line 1214) no Hoare annotation was computed. [2022-11-25 17:07:15,712 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1264) no Hoare annotation was computed. [2022-11-25 17:07:15,712 INFO L902 garLoopResultBuilder]: At program point L1272(line 1272) the Hoare annotation is: true [2022-11-25 17:07:15,712 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-11-25 17:07:15,712 INFO L899 garLoopResultBuilder]: For program point L1239-1(line 1239) no Hoare annotation was computed. [2022-11-25 17:07:15,712 INFO L899 garLoopResultBuilder]: For program point L1264(line 1264) no Hoare annotation was computed. [2022-11-25 17:07:15,713 INFO L899 garLoopResultBuilder]: For program point L1264-1(line 1264) no Hoare annotation was computed. [2022-11-25 17:07:15,713 INFO L899 garLoopResultBuilder]: For program point L1314(line 1314) no Hoare annotation was computed. [2022-11-25 17:07:15,713 INFO L899 garLoopResultBuilder]: For program point L1281(lines 1281 1309) no Hoare annotation was computed. [2022-11-25 17:07:15,713 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-11-25 17:07:15,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1254) no Hoare annotation was computed. [2022-11-25 17:07:15,714 INFO L895 garLoopResultBuilder]: At program point L1182(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-11-25 17:07:15,714 INFO L899 garLoopResultBuilder]: For program point L1215-1(line 1215) no Hoare annotation was computed. [2022-11-25 17:07:15,714 INFO L899 garLoopResultBuilder]: For program point L1240(lines 1240 1245) no Hoare annotation was computed. [2022-11-25 17:07:15,714 INFO L899 garLoopResultBuilder]: For program point L1298(lines 1298 1303) no Hoare annotation was computed. [2022-11-25 17:07:15,714 INFO L899 garLoopResultBuilder]: For program point L1232(lines 1232 1316) no Hoare annotation was computed. [2022-11-25 17:07:15,714 INFO L899 garLoopResultBuilder]: For program point L1290(line 1290) no Hoare annotation was computed. [2022-11-25 17:07:15,714 INFO L902 garLoopResultBuilder]: At program point L1315(line 1315) the Hoare annotation is: true [2022-11-25 17:07:15,715 INFO L899 garLoopResultBuilder]: For program point L1282(line 1282) no Hoare annotation was computed. [2022-11-25 17:07:15,715 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrEXIT(lines 1032 1039) no Hoare annotation was computed. [2022-11-25 17:07:15,715 INFO L902 garLoopResultBuilder]: At program point L1035(line 1035) the Hoare annotation is: true [2022-11-25 17:07:15,715 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_attrENTRY(lines 1032 1039) the Hoare annotation is: true [2022-11-25 17:07:15,715 INFO L902 garLoopResultBuilder]: At program point L1035-1(line 1035) the Hoare annotation is: true [2022-11-25 17:07:15,715 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrFINAL(lines 1032 1039) no Hoare annotation was computed. [2022-11-25 17:07:15,716 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_fileENTRY(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-11-25 17:07:15,716 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1437) no Hoare annotation was computed. [2022-11-25 17:07:15,716 INFO L899 garLoopResultBuilder]: For program point L1437(line 1437) no Hoare annotation was computed. [2022-11-25 17:07:15,716 INFO L899 garLoopResultBuilder]: For program point L1437-1(line 1437) no Hoare annotation was computed. [2022-11-25 17:07:15,716 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-11-25 17:07:15,717 INFO L899 garLoopResultBuilder]: For program point L1435-1(line 1435) no Hoare annotation was computed. [2022-11-25 17:07:15,717 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileFINAL(lines 1430 1448) no Hoare annotation was computed. [2022-11-25 17:07:15,717 INFO L899 garLoopResultBuilder]: For program point L1367(line 1367) no Hoare annotation was computed. [2022-11-25 17:07:15,717 INFO L895 garLoopResultBuilder]: At program point L1382(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-11-25 17:07:15,717 INFO L899 garLoopResultBuilder]: For program point L1378(lines 1378 1381) no Hoare annotation was computed. [2022-11-25 17:07:15,717 INFO L899 garLoopResultBuilder]: For program point L1378-1(lines 1378 1381) no Hoare annotation was computed. [2022-11-25 17:07:15,718 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-11-25 17:07:15,718 INFO L899 garLoopResultBuilder]: For program point L1376-1(line 1376) no Hoare annotation was computed. [2022-11-25 17:07:15,718 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1437) no Hoare annotation was computed. [2022-11-25 17:07:15,718 INFO L899 garLoopResultBuilder]: For program point L1438(lines 1438 1441) no Hoare annotation was computed. [2022-11-25 17:07:15,718 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileEXIT(lines 1430 1448) no Hoare annotation was computed. [2022-11-25 17:07:15,718 INFO L899 garLoopResultBuilder]: For program point L1436(lines 1436 1446) no Hoare annotation was computed. [2022-11-25 17:07:15,719 INFO L899 garLoopResultBuilder]: For program point L1438-2(lines 1438 1441) no Hoare annotation was computed. [2022-11-25 17:07:15,719 INFO L899 garLoopResultBuilder]: For program point L1364(lines 1364 1370) no Hoare annotation was computed. [2022-11-25 17:07:15,719 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-11-25 17:07:15,719 INFO L902 garLoopResultBuilder]: At program point IS_ERRENTRY(lines 1332 1339) the Hoare annotation is: true [2022-11-25 17:07:15,719 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 1332 1339) no Hoare annotation was computed. [2022-11-25 17:07:15,719 INFO L902 garLoopResultBuilder]: At program point L1336(line 1336) the Hoare annotation is: true [2022-11-25 17:07:15,719 INFO L899 garLoopResultBuilder]: For program point L1336-1(line 1336) no Hoare annotation was computed. [2022-11-25 17:07:15,720 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 1332 1339) no Hoare annotation was computed. [2022-11-25 17:07:15,723 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:15,725 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:07:15,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:07:15 BoogieIcfgContainer [2022-11-25 17:07:15,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:07:15,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:07:15,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:07:15,769 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:07:15,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:06:46" (3/4) ... [2022-11-25 17:07:15,772 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:07:15,779 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2022-11-25 17:07:15,780 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_probe [2022-11-25 17:07:15,780 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2022-11-25 17:07:15,780 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2022-11-25 17:07:15,780 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-25 17:07:15,780 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove [2022-11-25 17:07:15,780 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2022-11-25 17:07:15,780 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2022-11-25 17:07:15,781 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2022-11-25 17:07:15,781 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-25 17:07:15,781 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2022-11-25 17:07:15,781 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-25 17:07:15,782 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2022-11-25 17:07:15,782 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2022-11-25 17:07:15,782 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2022-11-25 17:07:15,782 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file [2022-11-25 17:07:15,782 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2022-11-25 17:07:15,796 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2022-11-25 17:07:15,797 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-25 17:07:15,798 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-25 17:07:15,799 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 17:07:15,800 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:07:15,827 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-11-25 17:07:15,828 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-11-25 17:07:15,829 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-11-25 17:07:15,829 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-11-25 17:07:15,829 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-11-25 17:07:15,830 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-11-25 17:07:15,830 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-11-25 17:07:15,830 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-11-25 17:07:15,830 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-11-25 17:07:15,831 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-11-25 17:07:15,831 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-11-25 17:07:15,832 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-11-25 17:07:15,832 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-11-25 17:07:15,833 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-11-25 17:07:15,833 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-11-25 17:07:15,834 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-11-25 17:07:15,834 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-11-25 17:07:15,835 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-11-25 17:07:15,835 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-11-25 17:07:15,836 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-11-25 17:07:15,836 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-11-25 17:07:15,837 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-11-25 17:07:15,837 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-11-25 17:07:15,895 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:07:15,895 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:07:15,896 INFO L158 Benchmark]: Toolchain (without parser) took 31840.23ms. Allocated memory was 140.5MB in the beginning and 432.0MB in the end (delta: 291.5MB). Free memory was 101.6MB in the beginning and 341.0MB in the end (delta: -239.4MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2022-11-25 17:07:15,896 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 140.5MB. Free memory was 81.5MB in the beginning and 81.3MB in the end (delta: 119.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:07:15,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 763.79ms. Allocated memory is still 140.5MB. Free memory was 101.6MB in the beginning and 67.2MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-25 17:07:15,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.55ms. Allocated memory is still 140.5MB. Free memory was 67.2MB in the beginning and 63.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:07:15,898 INFO L158 Benchmark]: Boogie Preprocessor took 63.21ms. Allocated memory is still 140.5MB. Free memory was 63.1MB in the beginning and 59.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:07:15,898 INFO L158 Benchmark]: RCFGBuilder took 1309.78ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 59.2MB in the beginning and 101.7MB in the end (delta: -42.5MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-11-25 17:07:15,899 INFO L158 Benchmark]: TraceAbstraction took 29484.03ms. Allocated memory was 169.9MB in the beginning and 432.0MB in the end (delta: 262.1MB). Free memory was 101.2MB in the beginning and 352.7MB in the end (delta: -251.5MB). Peak memory consumption was 228.7MB. Max. memory is 16.1GB. [2022-11-25 17:07:15,899 INFO L158 Benchmark]: Witness Printer took 127.33ms. Allocated memory is still 432.0MB. Free memory was 352.7MB in the beginning and 341.0MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 17:07:15,901 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 140.5MB. Free memory was 81.5MB in the beginning and 81.3MB in the end (delta: 119.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 763.79ms. Allocated memory is still 140.5MB. Free memory was 101.6MB in the beginning and 67.2MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.55ms. Allocated memory is still 140.5MB. Free memory was 67.2MB in the beginning and 63.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.21ms. Allocated memory is still 140.5MB. Free memory was 63.1MB in the beginning and 59.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1309.78ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 59.2MB in the beginning and 101.7MB in the end (delta: -42.5MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 29484.03ms. Allocated memory was 169.9MB in the beginning and 432.0MB in the end (delta: 262.1MB). Free memory was 101.2MB in the beginning and 352.7MB in the end (delta: -251.5MB). Peak memory consumption was 228.7MB. Max. memory is 16.1GB. * Witness Printer took 127.33ms. Allocated memory is still 432.0MB. Free memory was 352.7MB in the beginning and 341.0MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. 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: 29.4s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3889 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3667 mSDsluCounter, 11402 SdHoareTripleChecker+Invalid, 5.0s 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.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1827 GetRequests, 1719 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s 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: 1.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 1553 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 91 LocationsWithAnnotation, 2803 PreInvPairs, 3002 NumberOfFragments, 1934 HoareAnnotationTreeSize, 2803 FomulaSimplifications, 70614 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 91 FomulaSimplificationsInter, 33851 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 5.6s 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: 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: 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: 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 - 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: 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: 1155]: 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: 1185]: 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: 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: 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: 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: 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: 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: 1397]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1220]: Loop Invariant Derived loop invariant: 1 - 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: 1462]: Loop Invariant Derived loop invariant: 1 - 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: 876]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1499]: 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: 1053]: 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: 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: 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: 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: 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: 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: 1225]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1115]: 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: 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: 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: 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: 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: 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: 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: 1485]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 17:07:15,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6701bdb-a43f-4093-9c46-86bf6cdd1be7/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE