./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 14:27:26,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:27:26,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:27:26,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:27:26,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:27:26,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:27:26,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:27:26,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:27:26,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:27:26,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:27:26,293 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:27:26,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:27:26,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:27:26,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:27:26,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:27:26,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:27:26,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:27:26,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:27:26,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:27:26,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:27:26,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:27:26,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:27:26,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:27:26,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:27:26,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:27:26,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:27:26,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:27:26,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:27:26,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:27:26,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:27:26,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:27:26,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:27:26,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:27:26,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:27:26,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:27:26,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:27:26,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:27:26,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:27:26,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:27:26,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:27:26,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:27:26,312 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-12-13 14:27:26,327 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:27:26,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:27:26,327 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:27:26,328 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:27:26,328 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:27:26,328 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:27:26,329 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:27:26,329 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:27:26,329 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:27:26,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:27:26,329 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:27:26,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:27:26,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:27:26,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 14:27:26,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:27:26,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 14:27:26,330 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 14:27:26,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 14:27:26,330 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:27:26,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 14:27:26,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:27:26,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:27:26,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:27:26,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:27:26,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:27:26,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:27:26,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 14:27:26,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:27:26,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:27:26,331 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:27:26,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 14:27:26,331 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:27:26,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:27:26,332 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:27:26,332 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_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf [2022-12-13 14:27:26,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:27:26,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:27:26,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:27:26,519 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:27:26,519 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:27:26,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2022-12-13 14:27:29,103 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:27:29,334 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:27:29,334 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2022-12-13 14:27:29,348 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/data/72035c9ef/26fd3a4438ef4f13bf3cbe61092ca0c4/FLAG623f7d69b [2022-12-13 14:27:29,660 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/data/72035c9ef/26fd3a4438ef4f13bf3cbe61092ca0c4 [2022-12-13 14:27:29,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:27:29,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:27:29,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:27:29,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:27:29,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:27:29,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:27:29" (1/1) ... [2022-12-13 14:27:29,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e0ac0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:29, skipping insertion in model container [2022-12-13 14:27:29,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:27:29" (1/1) ... [2022-12-13 14:27:29,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:27:29,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:27:30,043 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 14:27:30,047 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 14:27:30,060 WARN L623 FunctionHandler]: Unknown extern function rdev_get_drvdata [2022-12-13 14:27:30,060 WARN L623 FunctionHandler]: Unknown extern function i2c_smbus_read_byte [2022-12-13 14:27:30,061 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 14:27:30,066 WARN L623 FunctionHandler]: Unknown extern function rdev_get_drvdata [2022-12-13 14:27:30,066 WARN L623 FunctionHandler]: Unknown extern function i2c_smbus_write_byte [2022-12-13 14:27:30,067 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 14:27:30,079 WARN L623 FunctionHandler]: Unknown extern function devm_kzalloc [2022-12-13 14:27:30,081 WARN L623 FunctionHandler]: Unknown extern function __mutex_init [2022-12-13 14:27:30,083 WARN L623 FunctionHandler]: Unknown extern function regulator_register [2022-12-13 14:27:30,084 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 14:27:30,088 WARN L623 FunctionHandler]: Unknown extern function regulator_unregister [2022-12-13 14:27:30,092 WARN L623 FunctionHandler]: Unknown extern function regulator_unregister [2022-12-13 14:27:30,101 WARN L623 FunctionHandler]: Unknown extern function i2c_register_driver [2022-12-13 14:27:30,104 WARN L623 FunctionHandler]: Unknown extern function i2c_del_driver [2022-12-13 14:27:30,114 WARN L623 FunctionHandler]: Unknown extern function regulator_list_voltage_linear [2022-12-13 14:27:30,114 WARN L623 FunctionHandler]: Unknown extern function regulator_map_voltage_linear [2022-12-13 14:27:30,117 WARN L623 FunctionHandler]: Unknown extern function regulator_list_voltage_linear [2022-12-13 14:27:30,119 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:27:30,119 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:27:30,120 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:27:30,121 WARN L623 FunctionHandler]: Unknown extern function mutex_trylock [2022-12-13 14:27:30,122 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:27:30,122 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:27:30,123 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:27:30,124 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:27:30,124 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:27:30,125 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:27:30,125 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:27:30,128 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_e8d04269-a8d3-4506-9907-2601807634d1/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2022-12-13 14:27:30,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:27:30,213 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:27:30,273 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 14:27:30,274 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 14:27:30,278 WARN L623 FunctionHandler]: Unknown extern function rdev_get_drvdata [2022-12-13 14:27:30,279 WARN L623 FunctionHandler]: Unknown extern function i2c_smbus_read_byte [2022-12-13 14:27:30,279 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 14:27:30,280 WARN L623 FunctionHandler]: Unknown extern function rdev_get_drvdata [2022-12-13 14:27:30,280 WARN L623 FunctionHandler]: Unknown extern function i2c_smbus_write_byte [2022-12-13 14:27:30,281 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 14:27:30,288 WARN L623 FunctionHandler]: Unknown extern function devm_kzalloc [2022-12-13 14:27:30,289 WARN L623 FunctionHandler]: Unknown extern function __mutex_init [2022-12-13 14:27:30,290 WARN L623 FunctionHandler]: Unknown extern function regulator_register [2022-12-13 14:27:30,291 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 14:27:30,292 WARN L623 FunctionHandler]: Unknown extern function regulator_unregister [2022-12-13 14:27:30,294 WARN L623 FunctionHandler]: Unknown extern function regulator_unregister [2022-12-13 14:27:30,297 WARN L623 FunctionHandler]: Unknown extern function i2c_register_driver [2022-12-13 14:27:30,298 WARN L623 FunctionHandler]: Unknown extern function i2c_del_driver [2022-12-13 14:27:30,301 WARN L623 FunctionHandler]: Unknown extern function regulator_list_voltage_linear [2022-12-13 14:27:30,302 WARN L623 FunctionHandler]: Unknown extern function regulator_map_voltage_linear [2022-12-13 14:27:30,303 WARN L623 FunctionHandler]: Unknown extern function regulator_list_voltage_linear [2022-12-13 14:27:30,304 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:27:30,305 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:27:30,305 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:27:30,306 WARN L623 FunctionHandler]: Unknown extern function mutex_trylock [2022-12-13 14:27:30,306 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:27:30,307 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:27:30,307 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:27:30,308 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:27:30,308 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:27:30,308 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-12-13 14:27:30,309 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 14:27:30,309 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_e8d04269-a8d3-4506-9907-2601807634d1/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2022-12-13 14:27:30,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:27:30,362 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:27:30,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:30 WrapperNode [2022-12-13 14:27:30,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:27:30,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:27:30,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:27:30,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:27:30,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:30" (1/1) ... [2022-12-13 14:27:30,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:30" (1/1) ... [2022-12-13 14:27:30,438 INFO L138 Inliner]: procedures = 99, calls = 345, calls flagged for inlining = 40, calls inlined = 32, statements flattened = 750 [2022-12-13 14:27:30,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:27:30,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:27:30,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:27:30,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:27:30,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:30" (1/1) ... [2022-12-13 14:27:30,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:30" (1/1) ... [2022-12-13 14:27:30,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:30" (1/1) ... [2022-12-13 14:27:30,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:30" (1/1) ... [2022-12-13 14:27:30,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:30" (1/1) ... [2022-12-13 14:27:30,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:30" (1/1) ... [2022-12-13 14:27:30,491 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:30" (1/1) ... [2022-12-13 14:27:30,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:30" (1/1) ... [2022-12-13 14:27:30,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:27:30,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:27:30,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:27:30,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:27:30,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:30" (1/1) ... [2022-12-13 14:27:30,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:27:30,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:27:30,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:27:30,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:27:30,566 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2022-12-13 14:27:30,566 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2022-12-13 14:27:30,566 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-13 14:27:30,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-13 14:27:30,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 14:27:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-12-13 14:27:30,567 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-12-13 14:27:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-12-13 14:27:30,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-12-13 14:27:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2022-12-13 14:27:30,567 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2022-12-13 14:27:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 14:27:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-12-13 14:27:30,568 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-12-13 14:27:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:27:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 14:27:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 14:27:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 14:27:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2022-12-13 14:27:30,568 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2022-12-13 14:27:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:27:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2022-12-13 14:27:30,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2022-12-13 14:27:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 14:27:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:27:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2022-12-13 14:27:30,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2022-12-13 14:27:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:27:30,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:27:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-12-13 14:27:30,570 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-12-13 14:27:30,730 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:27:30,732 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:27:31,276 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:27:31,285 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:27:31,285 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 14:27:31,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:27:31 BoogieIcfgContainer [2022-12-13 14:27:31,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:27:31,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:27:31,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:27:31,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:27:31,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:27:29" (1/3) ... [2022-12-13 14:27:31,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f231dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:27:31, skipping insertion in model container [2022-12-13 14:27:31,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:27:30" (2/3) ... [2022-12-13 14:27:31,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f231dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:27:31, skipping insertion in model container [2022-12-13 14:27:31,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:27:31" (3/3) ... [2022-12-13 14:27:31,295 INFO L112 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2022-12-13 14:27:31,310 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:27:31,310 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-12-13 14:27:31,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:27:31,354 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;@12f8e27e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:27:31,354 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-12-13 14:27:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 145 states have (on average 1.4206896551724137) internal successors, (206), 161 states have internal predecessors, (206), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-12-13 14:27:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 14:27:31,369 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:31,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:27:31,370 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:31,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:31,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1444456607, now seen corresponding path program 1 times [2022-12-13 14:27:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:31,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640059622] [2022-12-13 14:27:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:31,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:27:31,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:31,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640059622] [2022-12-13 14:27:31,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640059622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:31,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:27:31,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:27:31,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706950239] [2022-12-13 14:27:31,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:31,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:27:31,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:31,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:27:31,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:27:31,684 INFO L87 Difference]: Start difference. First operand has 192 states, 145 states have (on average 1.4206896551724137) internal successors, (206), 161 states have internal predecessors, (206), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:27:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:31,848 INFO L93 Difference]: Finished difference Result 497 states and 696 transitions. [2022-12-13 14:27:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:27:31,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2022-12-13 14:27:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:31,857 INFO L225 Difference]: With dead ends: 497 [2022-12-13 14:27:31,857 INFO L226 Difference]: Without dead ends: 272 [2022-12-13 14:27:31,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:27:31,862 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 156 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:31,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 501 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:27:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-12-13 14:27:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-12-13 14:27:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 211 states have (on average 1.3791469194312795) internal successors, (291), 220 states have internal predecessors, (291), 34 states have call successors, (34), 17 states have call predecessors, (34), 17 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-12-13 14:27:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 359 transitions. [2022-12-13 14:27:31,908 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 359 transitions. Word has length 15 [2022-12-13 14:27:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:31,908 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 359 transitions. [2022-12-13 14:27:31,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:27:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 359 transitions. [2022-12-13 14:27:31,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 14:27:31,910 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:31,910 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] [2022-12-13 14:27:31,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:27:31,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:31,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:31,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2072638708, now seen corresponding path program 1 times [2022-12-13 14:27:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:31,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962483214] [2022-12-13 14:27:31,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:31,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 14:27:32,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:32,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962483214] [2022-12-13 14:27:32,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962483214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:32,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:27:32,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:27:32,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763210367] [2022-12-13 14:27:32,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:32,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:27:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:32,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:27:32,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:27:32,071 INFO L87 Difference]: Start difference. First operand 272 states and 359 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:27:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:32,136 INFO L93 Difference]: Finished difference Result 541 states and 715 transitions. [2022-12-13 14:27:32,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:27:32,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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) Word has length 26 [2022-12-13 14:27:32,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:32,139 INFO L225 Difference]: With dead ends: 541 [2022-12-13 14:27:32,139 INFO L226 Difference]: Without dead ends: 537 [2022-12-13 14:27:32,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:27:32,140 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 196 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:32,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 453 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:27:32,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-12-13 14:27:32,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2022-12-13 14:27:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 419 states have (on average 1.3723150357995226) internal successors, (575), 428 states have internal predecessors, (575), 68 states have call successors, (68), 34 states have call predecessors, (68), 34 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-12-13 14:27:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 711 transitions. [2022-12-13 14:27:32,173 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 711 transitions. Word has length 26 [2022-12-13 14:27:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:32,174 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 711 transitions. [2022-12-13 14:27:32,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:27:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 711 transitions. [2022-12-13 14:27:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 14:27:32,175 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:32,176 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] [2022-12-13 14:27:32,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:27:32,176 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:32,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash -482153609, now seen corresponding path program 1 times [2022-12-13 14:27:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:32,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38019788] [2022-12-13 14:27:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:32,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:32,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:27:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:32,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:27:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:27:32,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:32,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38019788] [2022-12-13 14:27:32,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38019788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:32,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:27:32,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:27:32,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761628008] [2022-12-13 14:27:32,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:32,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:27:32,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:32,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:27:32,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:27:32,293 INFO L87 Difference]: Start difference. First operand 531 states and 711 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 14:27:32,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:32,701 INFO L93 Difference]: Finished difference Result 1179 states and 1583 transitions. [2022-12-13 14:27:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:27:32,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-12-13 14:27:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:32,707 INFO L225 Difference]: With dead ends: 1179 [2022-12-13 14:27:32,707 INFO L226 Difference]: Without dead ends: 651 [2022-12-13 14:27:32,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:27:32,711 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 204 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:32,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 680 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:27:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-12-13 14:27:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 626. [2022-12-13 14:27:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 493 states have (on average 1.3671399594320486) internal successors, (674), 502 states have internal predecessors, (674), 80 states have call successors, (80), 43 states have call predecessors, (80), 43 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2022-12-13 14:27:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 834 transitions. [2022-12-13 14:27:32,761 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 834 transitions. Word has length 36 [2022-12-13 14:27:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:32,761 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 834 transitions. [2022-12-13 14:27:32,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 14:27:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 834 transitions. [2022-12-13 14:27:32,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 14:27:32,764 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:32,764 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 14:27:32,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 14:27:32,764 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:32,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:32,764 INFO L85 PathProgramCache]: Analyzing trace with hash 888153265, now seen corresponding path program 1 times [2022-12-13 14:27:32,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:32,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031365947] [2022-12-13 14:27:32,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:32,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 14:27:32,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:32,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031365947] [2022-12-13 14:27:32,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031365947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:32,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:27:32,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:27:32,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257920591] [2022-12-13 14:27:32,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:32,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:27:32,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:32,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:27:32,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:27:32,889 INFO L87 Difference]: Start difference. First operand 626 states and 834 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:27:33,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:33,253 INFO L93 Difference]: Finished difference Result 1300 states and 1729 transitions. [2022-12-13 14:27:33,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:27:33,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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) Word has length 39 [2022-12-13 14:27:33,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:33,257 INFO L225 Difference]: With dead ends: 1300 [2022-12-13 14:27:33,257 INFO L226 Difference]: Without dead ends: 920 [2022-12-13 14:27:33,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:27:33,259 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 269 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:33,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 929 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:27:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-12-13 14:27:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 630. [2022-12-13 14:27:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 497 states have (on average 1.364185110663984) internal successors, (678), 506 states have internal predecessors, (678), 80 states have call successors, (80), 43 states have call predecessors, (80), 43 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2022-12-13 14:27:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 838 transitions. [2022-12-13 14:27:33,286 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 838 transitions. Word has length 39 [2022-12-13 14:27:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:33,286 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 838 transitions. [2022-12-13 14:27:33,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:27:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 838 transitions. [2022-12-13 14:27:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 14:27:33,288 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:33,288 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:27:33,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 14:27:33,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:33,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1659416553, now seen corresponding path program 1 times [2022-12-13 14:27:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:33,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91857425] [2022-12-13 14:27:33,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:33,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:33,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 14:27:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:33,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 14:27:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:33,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:27:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 14:27:33,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:33,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91857425] [2022-12-13 14:27:33,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91857425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:33,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:27:33,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:27:33,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363331282] [2022-12-13 14:27:33,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:33,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:27:33,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:33,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:27:33,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:27:33,428 INFO L87 Difference]: Start difference. First operand 630 states and 838 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 14:27:33,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:33,780 INFO L93 Difference]: Finished difference Result 1212 states and 1624 transitions. [2022-12-13 14:27:33,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:27:33,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-12-13 14:27:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:33,785 INFO L225 Difference]: With dead ends: 1212 [2022-12-13 14:27:33,785 INFO L226 Difference]: Without dead ends: 685 [2022-12-13 14:27:33,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:27:33,787 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 29 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:33,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 514 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:27:33,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-12-13 14:27:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 660. [2022-12-13 14:27:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 523 states have (on average 1.349904397705545) internal successors, (706), 532 states have internal predecessors, (706), 84 states have call successors, (84), 43 states have call predecessors, (84), 43 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-12-13 14:27:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 874 transitions. [2022-12-13 14:27:33,832 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 874 transitions. Word has length 51 [2022-12-13 14:27:33,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:33,832 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 874 transitions. [2022-12-13 14:27:33,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 14:27:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 874 transitions. [2022-12-13 14:27:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 14:27:33,834 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:33,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:27:33,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 14:27:33,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:33,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:33,836 INFO L85 PathProgramCache]: Analyzing trace with hash -757179182, now seen corresponding path program 1 times [2022-12-13 14:27:33,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:33,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618469662] [2022-12-13 14:27:33,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:33,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:34,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 14:27:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:34,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 14:27:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:34,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:27:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 14:27:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 14:27:34,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:34,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618469662] [2022-12-13 14:27:34,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618469662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:34,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:27:34,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:27:34,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129566985] [2022-12-13 14:27:34,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:34,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:27:34,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:34,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:27:34,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:27:34,026 INFO L87 Difference]: Start difference. First operand 660 states and 874 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 14:27:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:34,906 INFO L93 Difference]: Finished difference Result 1546 states and 2136 transitions. [2022-12-13 14:27:34,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:27:34,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 61 [2022-12-13 14:27:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:34,912 INFO L225 Difference]: With dead ends: 1546 [2022-12-13 14:27:34,912 INFO L226 Difference]: Without dead ends: 989 [2022-12-13 14:27:34,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:27:34,914 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 143 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:34,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1002 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 14:27:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2022-12-13 14:27:34,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 662. [2022-12-13 14:27:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 525 states have (on average 1.3485714285714285) internal successors, (708), 534 states have internal predecessors, (708), 84 states have call successors, (84), 43 states have call predecessors, (84), 43 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-12-13 14:27:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 876 transitions. [2022-12-13 14:27:34,964 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 876 transitions. Word has length 61 [2022-12-13 14:27:34,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:34,964 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 876 transitions. [2022-12-13 14:27:34,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 14:27:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 876 transitions. [2022-12-13 14:27:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 14:27:34,966 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:34,967 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] [2022-12-13 14:27:34,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 14:27:34,967 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:34,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:34,967 INFO L85 PathProgramCache]: Analyzing trace with hash 550582253, now seen corresponding path program 1 times [2022-12-13 14:27:34,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:34,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643932916] [2022-12-13 14:27:34,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:34,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:35,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 14:27:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:35,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 14:27:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:35,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:27:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:35,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 14:27:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:35,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 14:27:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 14:27:35,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:35,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643932916] [2022-12-13 14:27:35,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643932916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:27:35,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915520949] [2022-12-13 14:27:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:35,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:27:35,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:27:35,187 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:27:35,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 14:27:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:35,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 14:27:35,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:27:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 14:27:35,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:27:35,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915520949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:35,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:27:35,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-13 14:27:35,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7429088] [2022-12-13 14:27:35,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:35,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:27:35,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:27:35,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:27:35,544 INFO L87 Difference]: Start difference. First operand 662 states and 876 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 14:27:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:36,127 INFO L93 Difference]: Finished difference Result 1527 states and 2102 transitions. [2022-12-13 14:27:36,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:27:36,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 71 [2022-12-13 14:27:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:36,131 INFO L225 Difference]: With dead ends: 1527 [2022-12-13 14:27:36,131 INFO L226 Difference]: Without dead ends: 968 [2022-12-13 14:27:36,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:27:36,132 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 130 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:36,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 784 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 14:27:36,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-12-13 14:27:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 666. [2022-12-13 14:27:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 531 states have (on average 1.3370998116760828) internal successors, (710), 538 states have internal predecessors, (710), 84 states have call successors, (84), 43 states have call predecessors, (84), 43 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-12-13 14:27:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 878 transitions. [2022-12-13 14:27:36,186 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 878 transitions. Word has length 71 [2022-12-13 14:27:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:36,186 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 878 transitions. [2022-12-13 14:27:36,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 14:27:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 878 transitions. [2022-12-13 14:27:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-13 14:27:36,188 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:36,189 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:27:36,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 14:27:36,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:27:36,390 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:36,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:36,390 INFO L85 PathProgramCache]: Analyzing trace with hash -111819200, now seen corresponding path program 1 times [2022-12-13 14:27:36,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:36,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731194070] [2022-12-13 14:27:36,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:36,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:36,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 14:27:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:36,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 14:27:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:36,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:27:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:36,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 14:27:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:36,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 14:27:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 14:27:36,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:36,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731194070] [2022-12-13 14:27:36,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731194070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:36,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:27:36,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:27:36,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377154774] [2022-12-13 14:27:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:36,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:27:36,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:36,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:27:36,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:27:36,542 INFO L87 Difference]: Start difference. First operand 666 states and 878 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 14:27:37,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:37,193 INFO L93 Difference]: Finished difference Result 993 states and 1399 transitions. [2022-12-13 14:27:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:27:37,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2022-12-13 14:27:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:37,197 INFO L225 Difference]: With dead ends: 993 [2022-12-13 14:27:37,197 INFO L226 Difference]: Without dead ends: 991 [2022-12-13 14:27:37,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:27:37,198 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 148 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:37,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 707 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 14:27:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2022-12-13 14:27:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 660. [2022-12-13 14:27:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 527 states have (on average 1.3282732447817838) internal successors, (700), 532 states have internal predecessors, (700), 84 states have call successors, (84), 43 states have call predecessors, (84), 43 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-12-13 14:27:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 868 transitions. [2022-12-13 14:27:37,243 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 868 transitions. Word has length 72 [2022-12-13 14:27:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:37,243 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 868 transitions. [2022-12-13 14:27:37,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 14:27:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 868 transitions. [2022-12-13 14:27:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 14:27:37,246 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:37,246 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:27:37,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 14:27:37,247 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:37,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:37,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1584626497, now seen corresponding path program 1 times [2022-12-13 14:27:37,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:37,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038441236] [2022-12-13 14:27:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:37,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:37,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 14:27:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:37,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 14:27:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:37,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:27:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:37,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:27:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 14:27:37,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:37,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038441236] [2022-12-13 14:27:37,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038441236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:37,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:27:37,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:27:37,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652401248] [2022-12-13 14:27:37,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:37,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:27:37,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:37,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:27:37,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:27:37,414 INFO L87 Difference]: Start difference. First operand 660 states and 868 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 14:27:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:37,649 INFO L93 Difference]: Finished difference Result 1084 states and 1433 transitions. [2022-12-13 14:27:37,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:27:37,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2022-12-13 14:27:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:37,653 INFO L225 Difference]: With dead ends: 1084 [2022-12-13 14:27:37,653 INFO L226 Difference]: Without dead ends: 691 [2022-12-13 14:27:37,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:27:37,654 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 29 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:37,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 522 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:27:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-12-13 14:27:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 666. [2022-12-13 14:27:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 532 states have (on average 1.3251879699248121) internal successors, (705), 537 states have internal predecessors, (705), 85 states have call successors, (85), 43 states have call predecessors, (85), 43 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-12-13 14:27:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 875 transitions. [2022-12-13 14:27:37,692 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 875 transitions. Word has length 77 [2022-12-13 14:27:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:37,693 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 875 transitions. [2022-12-13 14:27:37,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 14:27:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 875 transitions. [2022-12-13 14:27:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 14:27:37,695 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:37,695 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:27:37,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 14:27:37,695 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:37,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:37,696 INFO L85 PathProgramCache]: Analyzing trace with hash -586388578, now seen corresponding path program 1 times [2022-12-13 14:27:37,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:37,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963686114] [2022-12-13 14:27:37,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:37,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:37,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 14:27:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:37,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 14:27:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:37,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:27:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:37,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:27:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:37,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:27:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 14:27:37,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:37,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963686114] [2022-12-13 14:27:37,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963686114] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:27:37,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076854252] [2022-12-13 14:27:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:37,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:27:37,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:27:37,833 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:27:37,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 14:27:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:38,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 14:27:38,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:27:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:27:38,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:27:38,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076854252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:38,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:27:38,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-12-13 14:27:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710673829] [2022-12-13 14:27:38,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:38,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:27:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:38,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:27:38,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:27:38,203 INFO L87 Difference]: Start difference. First operand 666 states and 875 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 14:27:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:38,331 INFO L93 Difference]: Finished difference Result 830 states and 1090 transitions. [2022-12-13 14:27:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:27:38,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 86 [2022-12-13 14:27:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:38,335 INFO L225 Difference]: With dead ends: 830 [2022-12-13 14:27:38,335 INFO L226 Difference]: Without dead ends: 828 [2022-12-13 14:27:38,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:27:38,337 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 337 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:38,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 555 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:27:38,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-12-13 14:27:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 664. [2022-12-13 14:27:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 532 states have (on average 1.3214285714285714) internal successors, (703), 535 states have internal predecessors, (703), 85 states have call successors, (85), 43 states have call predecessors, (85), 43 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-12-13 14:27:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 873 transitions. [2022-12-13 14:27:38,385 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 873 transitions. Word has length 86 [2022-12-13 14:27:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:38,385 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 873 transitions. [2022-12-13 14:27:38,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 14:27:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 873 transitions. [2022-12-13 14:27:38,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 14:27:38,388 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:38,388 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:27:38,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 14:27:38,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:27:38,589 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:38,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:38,589 INFO L85 PathProgramCache]: Analyzing trace with hash -998176513, now seen corresponding path program 1 times [2022-12-13 14:27:38,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:38,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102756402] [2022-12-13 14:27:38,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:38,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:38,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 14:27:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:38,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 14:27:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:38,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:27:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:38,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:27:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:38,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:27:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 14:27:38,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:38,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102756402] [2022-12-13 14:27:38,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102756402] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:27:38,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051700547] [2022-12-13 14:27:38,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:38,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:27:38,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:27:38,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:27:38,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 14:27:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:39,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 1345 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 14:27:39,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:27:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:27:39,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:27:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 14:27:39,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051700547] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:27:39,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:27:39,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2022-12-13 14:27:39,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196585294] [2022-12-13 14:27:39,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:27:39,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:27:39,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:39,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:27:39,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:27:39,235 INFO L87 Difference]: Start difference. First operand 664 states and 873 transitions. Second operand has 9 states, 9 states have (on average 22.11111111111111) internal successors, (199), 8 states have internal predecessors, (199), 6 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-12-13 14:27:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:39,957 INFO L93 Difference]: Finished difference Result 1676 states and 2221 transitions. [2022-12-13 14:27:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 14:27:39,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 22.11111111111111) internal successors, (199), 8 states have internal predecessors, (199), 6 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 87 [2022-12-13 14:27:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:39,967 INFO L225 Difference]: With dead ends: 1676 [2022-12-13 14:27:39,967 INFO L226 Difference]: Without dead ends: 1279 [2022-12-13 14:27:39,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-12-13 14:27:39,969 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 1244 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:39,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 826 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 14:27:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2022-12-13 14:27:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1068. [2022-12-13 14:27:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 858 states have (on average 1.3205128205128205) internal successors, (1133), 860 states have internal predecessors, (1133), 138 states have call successors, (138), 69 states have call predecessors, (138), 69 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-12-13 14:27:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1409 transitions. [2022-12-13 14:27:40,053 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1409 transitions. Word has length 87 [2022-12-13 14:27:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:40,054 INFO L495 AbstractCegarLoop]: Abstraction has 1068 states and 1409 transitions. [2022-12-13 14:27:40,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.11111111111111) internal successors, (199), 8 states have internal predecessors, (199), 6 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-12-13 14:27:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1409 transitions. [2022-12-13 14:27:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 14:27:40,055 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:40,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-12-13 14:27:40,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 14:27:40,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 14:27:40,256 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1776817678, now seen corresponding path program 1 times [2022-12-13 14:27:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:40,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45883087] [2022-12-13 14:27:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:40,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 14:27:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 14:27:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:40,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:27:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:40,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:27:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:40,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:27:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:40,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 14:27:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 14:27:40,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:40,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45883087] [2022-12-13 14:27:40,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45883087] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:27:40,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126064501] [2022-12-13 14:27:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:40,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:27:40,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:27:40,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:27:40,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 14:27:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:40,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 14:27:40,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:27:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 14:27:40,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:27:40,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126064501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:40,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:27:40,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-13 14:27:40,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499895753] [2022-12-13 14:27:40,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:40,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:27:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:40,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:27:40,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:27:40,749 INFO L87 Difference]: Start difference. First operand 1068 states and 1409 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 14:27:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:40,874 INFO L93 Difference]: Finished difference Result 1712 states and 2386 transitions. [2022-12-13 14:27:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:27:40,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 90 [2022-12-13 14:27:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:40,878 INFO L225 Difference]: With dead ends: 1712 [2022-12-13 14:27:40,878 INFO L226 Difference]: Without dead ends: 1711 [2022-12-13 14:27:40,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:27:40,879 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 273 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:40,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 598 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:27:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2022-12-13 14:27:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1067. [2022-12-13 14:27:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 858 states have (on average 1.3158508158508158) internal successors, (1129), 859 states have internal predecessors, (1129), 138 states have call successors, (138), 69 states have call predecessors, (138), 69 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-12-13 14:27:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1405 transitions. [2022-12-13 14:27:40,932 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1405 transitions. Word has length 90 [2022-12-13 14:27:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:40,933 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 1405 transitions. [2022-12-13 14:27:40,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 14:27:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1405 transitions. [2022-12-13 14:27:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-13 14:27:40,934 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:40,934 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:27:40,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 14:27:41,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 14:27:41,135 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:41,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1714430278, now seen corresponding path program 1 times [2022-12-13 14:27:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:41,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352742534] [2022-12-13 14:27:41,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 14:27:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 14:27:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:27:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:27:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:27:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 14:27:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 14:27:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 14:27:41,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:41,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352742534] [2022-12-13 14:27:41,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352742534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:41,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:27:41,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:27:41,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571556176] [2022-12-13 14:27:41,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:41,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:27:41,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:41,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:27:41,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:27:41,238 INFO L87 Difference]: Start difference. First operand 1067 states and 1405 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 14:27:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:41,486 INFO L93 Difference]: Finished difference Result 1107 states and 1464 transitions. [2022-12-13 14:27:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:27:41,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (6), 2 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 100 [2022-12-13 14:27:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:41,494 INFO L225 Difference]: With dead ends: 1107 [2022-12-13 14:27:41,494 INFO L226 Difference]: Without dead ends: 1106 [2022-12-13 14:27:41,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:27:41,495 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 25 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:41,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 507 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:27:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2022-12-13 14:27:41,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1056. [2022-12-13 14:27:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 850 states have (on average 1.316470588235294) internal successors, (1119), 850 states have internal predecessors, (1119), 136 states have call successors, (136), 69 states have call predecessors, (136), 69 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2022-12-13 14:27:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1391 transitions. [2022-12-13 14:27:41,554 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1391 transitions. Word has length 100 [2022-12-13 14:27:41,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:41,554 INFO L495 AbstractCegarLoop]: Abstraction has 1056 states and 1391 transitions. [2022-12-13 14:27:41,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 14:27:41,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1391 transitions. [2022-12-13 14:27:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-13 14:27:41,557 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:41,557 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:27:41,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 14:27:41,557 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:41,557 INFO L85 PathProgramCache]: Analyzing trace with hash 119248224, now seen corresponding path program 1 times [2022-12-13 14:27:41,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:41,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943508023] [2022-12-13 14:27:41,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 14:27:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 14:27:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:27:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 14:27:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 14:27:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-12-13 14:27:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 14:27:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 14:27:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 14:27:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-12-13 14:27:41,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:41,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943508023] [2022-12-13 14:27:41,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943508023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:41,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:27:41,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:27:41,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217566834] [2022-12-13 14:27:41,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:41,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:27:41,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:41,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:27:41,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:27:41,768 INFO L87 Difference]: Start difference. First operand 1056 states and 1391 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 14:27:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:42,226 INFO L93 Difference]: Finished difference Result 1839 states and 2424 transitions. [2022-12-13 14:27:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:27:42,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (6), 2 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 149 [2022-12-13 14:27:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:42,231 INFO L225 Difference]: With dead ends: 1839 [2022-12-13 14:27:42,231 INFO L226 Difference]: Without dead ends: 886 [2022-12-13 14:27:42,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:27:42,233 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 172 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:42,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 704 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:27:42,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-12-13 14:27:42,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 856. [2022-12-13 14:27:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 694 states have (on average 1.298270893371758) internal successors, (901), 694 states have internal predecessors, (901), 108 states have call successors, (108), 53 states have call predecessors, (108), 53 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2022-12-13 14:27:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1117 transitions. [2022-12-13 14:27:42,301 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1117 transitions. Word has length 149 [2022-12-13 14:27:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:42,302 INFO L495 AbstractCegarLoop]: Abstraction has 856 states and 1117 transitions. [2022-12-13 14:27:42,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 14:27:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1117 transitions. [2022-12-13 14:27:42,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-13 14:27:42,306 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:27:42,306 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-12-13 14:27:42,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 14:27:42,306 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-13 14:27:42,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:27:42,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1081844474, now seen corresponding path program 2 times [2022-12-13 14:27:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:27:42,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698833534] [2022-12-13 14:27:42,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:27:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:27:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:42,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 14:27:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 14:27:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:42,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:27:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:42,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 14:27:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-12-13 14:27:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:42,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 14:27:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:42,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 14:27:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:42,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 14:27:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:42,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-12-13 14:27:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:27:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-12-13 14:27:42,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:27:42,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698833534] [2022-12-13 14:27:42,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698833534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:27:42,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:27:42,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:27:42,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568950919] [2022-12-13 14:27:42,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:27:42,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:27:42,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:27:42,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:27:42,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:27:42,510 INFO L87 Difference]: Start difference. First operand 856 states and 1117 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 14:27:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:27:42,806 INFO L93 Difference]: Finished difference Result 1158 states and 1513 transitions. [2022-12-13 14:27:42,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:27:42,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (6), 2 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 171 [2022-12-13 14:27:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:27:42,807 INFO L225 Difference]: With dead ends: 1158 [2022-12-13 14:27:42,807 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 14:27:42,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:27:42,809 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 180 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:27:42,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 617 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:27:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 14:27:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 14:27:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:27:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 14:27:42,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 171 [2022-12-13 14:27:42,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:27:42,810 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 14:27:42,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 14:27:42,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 14:27:42,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 14:27:42,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-12-13 14:27:42,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-12-13 14:27:42,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-12-13 14:27:42,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-12-13 14:27:42,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-12-13 14:27:42,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-12-13 14:27:42,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-12-13 14:27:42,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-12-13 14:27:42,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-12-13 14:27:42,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-12-13 14:27:42,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 14:27:42,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 14:27:45,970 INFO L899 garLoopResultBuilder]: For program point L2945(lines 2945 2948) no Hoare annotation was computed. [2022-12-13 14:27:45,970 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_mtx_of_isl_pmicEXIT(lines 2942 2952) no Hoare annotation was computed. [2022-12-13 14:27:45,970 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2942 2952) the Hoare annotation is: true [2022-12-13 14:27:45,970 INFO L899 garLoopResultBuilder]: For program point L2947-1(lines 2945 2948) no Hoare annotation was computed. [2022-12-13 14:27:45,970 INFO L902 garLoopResultBuilder]: At program point L2947(line 2947) the Hoare annotation is: true [2022-12-13 14:27:45,971 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_mtx_of_isl_pmicFINAL(lines 2942 2952) no Hoare annotation was computed. [2022-12-13 14:27:45,971 INFO L899 garLoopResultBuilder]: For program point L3005-1(lines 3003 3006) no Hoare annotation was computed. [2022-12-13 14:27:45,971 INFO L902 garLoopResultBuilder]: At program point L3005(line 3005) the Hoare annotation is: true [2022-12-13 14:27:45,971 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_unlock_mtx_of_isl_pmicEXIT(lines 3000 3010) no Hoare annotation was computed. [2022-12-13 14:27:45,971 INFO L899 garLoopResultBuilder]: For program point L3003(lines 3003 3006) no Hoare annotation was computed. [2022-12-13 14:27:45,971 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 3000 3010) the Hoare annotation is: true [2022-12-13 14:27:45,971 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_unlock_mtx_of_isl_pmicFINAL(lines 3000 3010) no Hoare annotation was computed. [2022-12-13 14:27:45,971 INFO L899 garLoopResultBuilder]: For program point regulator_list_voltage_linearFINAL(lines 3204 3206) no Hoare annotation was computed. [2022-12-13 14:27:45,971 INFO L899 garLoopResultBuilder]: For program point regulator_list_voltage_linearEXIT(lines 3204 3206) no Hoare annotation was computed. [2022-12-13 14:27:45,971 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 3204 3206) the Hoare annotation is: true [2022-12-13 14:27:45,971 INFO L899 garLoopResultBuilder]: For program point mutex_unlockEXIT(lines 3197 3199) no Hoare annotation was computed. [2022-12-13 14:27:45,971 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 3197 3199) the Hoare annotation is: true [2022-12-13 14:27:45,971 INFO L899 garLoopResultBuilder]: For program point mutex_unlockFINAL(lines 3197 3199) no Hoare annotation was computed. [2022-12-13 14:27:45,971 INFO L902 garLoopResultBuilder]: At program point L3162(line 3162) the Hoare annotation is: true [2022-12-13 14:27:45,971 INFO L899 garLoopResultBuilder]: For program point L3160(line 3160) no Hoare annotation was computed. [2022-12-13 14:27:45,971 INFO L899 garLoopResultBuilder]: For program point L3162-1(line 3162) no Hoare annotation was computed. [2022-12-13 14:27:45,972 INFO L899 garLoopResultBuilder]: For program point L3156(line 3156) no Hoare annotation was computed. [2022-12-13 14:27:45,972 INFO L899 garLoopResultBuilder]: For program point L3155(lines 3155 3157) no Hoare annotation was computed. [2022-12-13 14:27:45,972 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 3158 3164) no Hoare annotation was computed. [2022-12-13 14:27:45,972 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 3158 3164) the Hoare annotation is: (let ((.cse2 (not (<= 0 ~ref_cnt~0))) (.cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~ldv_state_variable_0~0 3))) (.cse3 (not (<= ~ref_cnt~0 0)))) (and (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse0 .cse1 (not (<= ~ref_cnt~0 1))) (or (not (= ~ldv_state_variable_1~0 0)) .cse2 .cse0 .cse3) (or .cse2 (not (= ~ldv_state_variable_1~0 1)) .cse0 .cse1 .cse3))) [2022-12-13 14:27:45,972 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 3158 3164) no Hoare annotation was computed. [2022-12-13 14:27:45,972 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2684 2689) no Hoare annotation was computed. [2022-12-13 14:27:45,972 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 2684 2689) the Hoare annotation is: true [2022-12-13 14:27:45,973 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2684 2689) no Hoare annotation was computed. [2022-12-13 14:27:45,973 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 3214 3216) the Hoare annotation is: true [2022-12-13 14:27:45,973 INFO L899 garLoopResultBuilder]: For program point regulator_unregisterFINAL(lines 3214 3216) no Hoare annotation was computed. [2022-12-13 14:27:45,973 INFO L899 garLoopResultBuilder]: For program point regulator_unregisterEXIT(lines 3214 3216) no Hoare annotation was computed. [2022-12-13 14:27:45,973 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 3190 3192) the Hoare annotation is: true [2022-12-13 14:27:45,973 INFO L899 garLoopResultBuilder]: For program point mutex_lockFINAL(lines 3190 3192) no Hoare annotation was computed. [2022-12-13 14:27:45,973 INFO L899 garLoopResultBuilder]: For program point mutex_lockEXIT(lines 3190 3192) no Hoare annotation was computed. [2022-12-13 14:27:45,973 INFO L899 garLoopResultBuilder]: For program point L2529(lines 2529 2533) no Hoare annotation was computed. [2022-12-13 14:27:45,973 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2368) no Hoare annotation was computed. [2022-12-13 14:27:45,974 INFO L895 garLoopResultBuilder]: At program point L2678(line 2678) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,974 INFO L895 garLoopResultBuilder]: At program point ldv_initialize_returnLabel#1(lines 3113 3122) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)) [2022-12-13 14:27:45,974 INFO L895 garLoopResultBuilder]: At program point isl6271a_remove_returnLabel#1(lines 2378 2399) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_isl6271a_remove_~i~1#1|) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-12-13 14:27:45,974 INFO L895 garLoopResultBuilder]: At program point L2678-1(line 2678) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,974 INFO L899 garLoopResultBuilder]: For program point L2480(line 2480) no Hoare annotation was computed. [2022-12-13 14:27:45,974 INFO L895 garLoopResultBuilder]: At program point L2662(line 2662) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,974 INFO L895 garLoopResultBuilder]: At program point L2662-1(line 2662) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,975 INFO L895 garLoopResultBuilder]: At program point L2530(line 2530) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,975 INFO L899 garLoopResultBuilder]: For program point L2563(line 2563) no Hoare annotation was computed. [2022-12-13 14:27:45,975 INFO L899 garLoopResultBuilder]: For program point L2464(lines 2464 2468) no Hoare annotation was computed. [2022-12-13 14:27:45,975 INFO L899 garLoopResultBuilder]: For program point L2530-1(line 2530) no Hoare annotation was computed. [2022-12-13 14:27:45,975 INFO L895 garLoopResultBuilder]: At program point devm_kzalloc_returnLabel#1(lines 3172 3174) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-12-13 14:27:45,975 INFO L895 garLoopResultBuilder]: At program point L2679(lines 2675 2682) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,975 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2476) no Hoare annotation was computed. [2022-12-13 14:27:45,976 INFO L895 garLoopResultBuilder]: At program point L2663(lines 2659 2666) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,976 INFO L895 garLoopResultBuilder]: At program point isl6271a_remove_ldv_20002#1(lines 2382 2398) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_isl6271a_remove_~i~1#1|) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-12-13 14:27:45,976 INFO L899 garLoopResultBuilder]: For program point L2564(lines 2564 2579) no Hoare annotation was computed. [2022-12-13 14:27:45,976 INFO L895 garLoopResultBuilder]: At program point isl6271a_set_voltage_sel_returnLabel#1(lines 2269 2285) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,976 INFO L895 garLoopResultBuilder]: At program point L2366(line 2366) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (<= 0 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (= ~ldv_state_variable_0~0 3)) [2022-12-13 14:27:45,976 INFO L899 garLoopResultBuilder]: For program point L2366-1(line 2366) no Hoare annotation was computed. [2022-12-13 14:27:45,976 INFO L899 garLoopResultBuilder]: For program point L3126(lines 3126 3129) no Hoare annotation was computed. [2022-12-13 14:27:45,977 INFO L899 garLoopResultBuilder]: For program point L2581(line 2581) no Hoare annotation was computed. [2022-12-13 14:27:45,977 INFO L895 garLoopResultBuilder]: At program point dev_get_drvdata_returnLabel#1(lines 3165 3167) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-12-13 14:27:45,977 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2476) no Hoare annotation was computed. [2022-12-13 14:27:45,977 INFO L899 garLoopResultBuilder]: For program point L2466(line 2466) no Hoare annotation was computed. [2022-12-13 14:27:45,977 INFO L899 garLoopResultBuilder]: For program point L2499(line 2499) no Hoare annotation was computed. [2022-12-13 14:27:45,977 INFO L899 garLoopResultBuilder]: For program point L2466-1(line 2466) no Hoare annotation was computed. [2022-12-13 14:27:45,977 INFO L895 garLoopResultBuilder]: At program point i2c_check_functionality_returnLabel#1(lines 2245 2251) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-12-13 14:27:45,977 INFO L895 garLoopResultBuilder]: At program point L2367(lines 2310 2376) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (<= 0 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (= ~ldv_state_variable_0~0 3)) [2022-12-13 14:27:45,977 INFO L899 garLoopResultBuilder]: For program point L2549(line 2549) no Hoare annotation was computed. [2022-12-13 14:27:45,978 INFO L895 garLoopResultBuilder]: At program point i2c_smbus_read_byte_returnLabel#1(lines 3183 3185) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,978 INFO L899 garLoopResultBuilder]: For program point L2566(lines 2566 2576) no Hoare annotation was computed. [2022-12-13 14:27:45,978 INFO L899 garLoopResultBuilder]: For program point L2500(lines 2500 2515) no Hoare annotation was computed. [2022-12-13 14:27:45,978 INFO L899 garLoopResultBuilder]: For program point L2368(line 2368) no Hoare annotation was computed. [2022-12-13 14:27:45,978 INFO L902 garLoopResultBuilder]: At program point L3128(line 3128) the Hoare annotation is: true [2022-12-13 14:27:45,978 INFO L895 garLoopResultBuilder]: At program point i2c_set_clientdata_returnLabel#1(lines 2229 2235) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-12-13 14:27:45,978 INFO L899 garLoopResultBuilder]: For program point L2550(lines 2550 2554) no Hoare annotation was computed. [2022-12-13 14:27:45,978 INFO L899 garLoopResultBuilder]: For program point L3128-1(lines 3125 3143) no Hoare annotation was computed. [2022-12-13 14:27:45,978 INFO L899 garLoopResultBuilder]: For program point L2517(line 2517) no Hoare annotation was computed. [2022-12-13 14:27:45,978 INFO L895 garLoopResultBuilder]: At program point dev_set_drvdata_returnLabel#1(lines 3169 3171) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-12-13 14:27:45,978 INFO L899 garLoopResultBuilder]: For program point L2567(line 2567) no Hoare annotation was computed. [2022-12-13 14:27:45,978 INFO L899 garLoopResultBuilder]: For program point L2369(lines 2369 2373) no Hoare annotation was computed. [2022-12-13 14:27:45,979 INFO L899 garLoopResultBuilder]: For program point L2353-1(line 2353) no Hoare annotation was computed. [2022-12-13 14:27:45,979 INFO L899 garLoopResultBuilder]: For program point L2353(line 2353) no Hoare annotation was computed. [2022-12-13 14:27:45,979 INFO L895 garLoopResultBuilder]: At program point L3212(line 3212) the Hoare annotation is: (let ((.cse0 (<= ~ref_cnt~0 0)) (.cse1 (<= 0 ~ref_cnt~0)) (.cse2 (= ~ldv_state_variable_1~0 1)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse2 .cse3))) [2022-12-13 14:27:45,979 INFO L899 garLoopResultBuilder]: For program point L3212-1(line 3212) no Hoare annotation was computed. [2022-12-13 14:27:45,979 INFO L899 garLoopResultBuilder]: For program point L2568(lines 2568 2572) no Hoare annotation was computed. [2022-12-13 14:27:45,979 INFO L899 garLoopResultBuilder]: For program point L2502(lines 2502 2508) no Hoare annotation was computed. [2022-12-13 14:27:45,979 INFO L899 garLoopResultBuilder]: For program point L2535(line 2535) no Hoare annotation was computed. [2022-12-13 14:27:45,979 INFO L899 garLoopResultBuilder]: For program point L2502-2(lines 2500 2514) no Hoare annotation was computed. [2022-12-13 14:27:45,979 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 14:27:45,979 INFO L899 garLoopResultBuilder]: For program point L2337(lines 2337 2341) no Hoare annotation was computed. [2022-12-13 14:27:45,979 INFO L899 garLoopResultBuilder]: For program point L2337-2(lines 2337 2341) no Hoare annotation was computed. [2022-12-13 14:27:45,979 INFO L895 garLoopResultBuilder]: At program point isl6271a_probe_ldv_19994#1(lines 2310 2376) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_isl6271a_probe_~i~0#1| 1) 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-12-13 14:27:45,979 INFO L899 garLoopResultBuilder]: For program point L2321(lines 2321 2324) no Hoare annotation was computed. [2022-12-13 14:27:45,979 INFO L895 garLoopResultBuilder]: At program point regulator_map_voltage_linear_returnLabel#1(lines 3208 3210) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,979 INFO L899 garLoopResultBuilder]: For program point L2536(lines 2536 2540) no Hoare annotation was computed. [2022-12-13 14:27:45,979 INFO L899 garLoopResultBuilder]: For program point L2569-1(line 2569) no Hoare annotation was computed. [2022-12-13 14:27:45,980 INFO L902 garLoopResultBuilder]: At program point isl6271a_cleanup_returnLabel#1(lines 2421 2427) the Hoare annotation is: true [2022-12-13 14:27:45,980 INFO L895 garLoopResultBuilder]: At program point L2569(line 2569) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,980 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2368) no Hoare annotation was computed. [2022-12-13 14:27:45,980 INFO L895 garLoopResultBuilder]: At program point L2454(lines 2447 2589) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,980 INFO L899 garLoopResultBuilder]: For program point L2487(line 2487) no Hoare annotation was computed. [2022-12-13 14:27:45,980 INFO L895 garLoopResultBuilder]: At program point isl6271a_get_voltage_sel_returnLabel#1(lines 2252 2268) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,980 INFO L895 garLoopResultBuilder]: At program point L2388(line 2388) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 2)) (.cse1 (<= 1 ~ref_cnt~0)) (.cse2 (= ~ldv_state_variable_0~0 3)) (.cse3 (<= ~ref_cnt~0 1))) (or (and .cse0 (= |ULTIMATE.start_isl6271a_remove_~i~1#1| 0) .cse1 .cse2 .cse3) (and (<= |ULTIMATE.start_isl6271a_remove_~i~1#1| 2) (<= 1 |ULTIMATE.start_isl6271a_remove_~i~1#1|) .cse0 .cse1 .cse2 .cse3))) [2022-12-13 14:27:45,980 INFO L899 garLoopResultBuilder]: For program point L2388-1(line 2388) no Hoare annotation was computed. [2022-12-13 14:27:45,981 INFO L902 garLoopResultBuilder]: At program point i2c_del_driver_returnLabel#1(lines 3175 3177) the Hoare annotation is: true [2022-12-13 14:27:45,981 INFO L895 garLoopResultBuilder]: At program point i2c_get_functionality_returnLabel#1(lines 2238 2244) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-12-13 14:27:45,981 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2389) no Hoare annotation was computed. [2022-12-13 14:27:45,981 INFO L902 garLoopResultBuilder]: At program point L3132(line 3132) the Hoare annotation is: true [2022-12-13 14:27:45,981 INFO L899 garLoopResultBuilder]: For program point L3132-1(lines 3125 3143) no Hoare annotation was computed. [2022-12-13 14:27:45,981 INFO L899 garLoopResultBuilder]: For program point L2488(lines 2488 2522) no Hoare annotation was computed. [2022-12-13 14:27:45,981 INFO L899 garLoopResultBuilder]: For program point L2389-1(line 2389) no Hoare annotation was computed. [2022-12-13 14:27:45,981 INFO L899 garLoopResultBuilder]: For program point L2389(line 2389) no Hoare annotation was computed. [2022-12-13 14:27:45,981 INFO L899 garLoopResultBuilder]: For program point L2257-1(line 2257) no Hoare annotation was computed. [2022-12-13 14:27:45,982 INFO L895 garLoopResultBuilder]: At program point L2257(line 2257) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,982 INFO L895 garLoopResultBuilder]: At program point L2670(line 2670) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,982 INFO L895 garLoopResultBuilder]: At program point isl6271a_probe_ldv_19991#1(lines 2310 2376) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-12-13 14:27:45,982 INFO L895 garLoopResultBuilder]: At program point L2670-1(line 2670) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,982 INFO L899 garLoopResultBuilder]: For program point L2472(line 2472) no Hoare annotation was computed. [2022-12-13 14:27:45,982 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 2441 2590) the Hoare annotation is: true [2022-12-13 14:27:45,982 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2389) no Hoare annotation was computed. [2022-12-13 14:27:45,982 INFO L895 garLoopResultBuilder]: At program point $Ultimate##31(lines 2391 2395) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 2)) (.cse1 (<= 1 ~ref_cnt~0)) (.cse2 (= ~ldv_state_variable_0~0 3)) (.cse3 (<= ~ref_cnt~0 1))) (or (and .cse0 (= |ULTIMATE.start_isl6271a_remove_~i~1#1| 0) .cse1 .cse2 .cse3) (and (<= 1 |ULTIMATE.start_isl6271a_remove_~i~1#1|) .cse0 .cse1 .cse2 .cse3))) [2022-12-13 14:27:45,982 INFO L895 garLoopResultBuilder]: At program point L2274(line 2274) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,982 INFO L899 garLoopResultBuilder]: For program point L2274-1(line 2274) no Hoare annotation was computed. [2022-12-13 14:27:45,982 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2353) no Hoare annotation was computed. [2022-12-13 14:27:45,982 INFO L895 garLoopResultBuilder]: At program point L3166(line 3166) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-12-13 14:27:45,983 INFO L895 garLoopResultBuilder]: At program point L2654(line 2654) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,983 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 14:27:45,983 INFO L899 garLoopResultBuilder]: For program point L3166-1(line 3166) no Hoare annotation was computed. [2022-12-13 14:27:45,983 INFO L895 garLoopResultBuilder]: At program point L2654-1(line 2654) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,983 INFO L899 garLoopResultBuilder]: For program point L2456(lines 2456 2583) no Hoare annotation was computed. [2022-12-13 14:27:45,983 INFO L895 garLoopResultBuilder]: At program point isl6271a_probe_returnLabel#1(lines 2299 2377) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-12-13 14:27:45,983 INFO L895 garLoopResultBuilder]: At program point L2671(lines 2667 2674) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,983 INFO L899 garLoopResultBuilder]: For program point L2473(lines 2473 2478) no Hoare annotation was computed. [2022-12-13 14:27:45,983 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2353) no Hoare annotation was computed. [2022-12-13 14:27:45,983 INFO L895 garLoopResultBuilder]: At program point __mutex_init_returnLabel#1(lines 3145 3147) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-12-13 14:27:45,983 INFO L895 garLoopResultBuilder]: At program point L2655(lines 2651 2658) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,983 INFO L899 garLoopResultBuilder]: For program point L2556(line 2556) no Hoare annotation was computed. [2022-12-13 14:27:45,984 INFO L899 garLoopResultBuilder]: For program point L2490(lines 2490 2519) no Hoare annotation was computed. [2022-12-13 14:27:45,984 INFO L899 garLoopResultBuilder]: For program point L2457(line 2457) no Hoare annotation was computed. [2022-12-13 14:27:45,984 INFO L895 garLoopResultBuilder]: At program point isl6271a_probe_ldv_19992#1(lines 2310 2376) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (<= 0 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (= ~ldv_state_variable_0~0 3)) [2022-12-13 14:27:45,984 INFO L895 garLoopResultBuilder]: At program point $Ultimate##19(lines 2355 2359) the Hoare annotation is: (let ((.cse0 (<= ~ref_cnt~0 0)) (.cse1 (<= 0 ~ref_cnt~0)) (.cse2 (= ~ldv_state_variable_1~0 1)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse2 .cse3) (and .cse0 (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) .cse1 .cse2 .cse3))) [2022-12-13 14:27:45,984 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 14:27:45,984 INFO L899 garLoopResultBuilder]: For program point L2524(line 2524) no Hoare annotation was computed. [2022-12-13 14:27:45,984 INFO L899 garLoopResultBuilder]: For program point L2458(lines 2458 2485) no Hoare annotation was computed. [2022-12-13 14:27:45,984 INFO L895 garLoopResultBuilder]: At program point i2c_get_clientdata_returnLabel#1(lines 2222 2228) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-12-13 14:27:45,984 INFO L902 garLoopResultBuilder]: At program point main_ldv_final#1(lines 2447 2589) the Hoare annotation is: true [2022-12-13 14:27:45,984 INFO L899 garLoopResultBuilder]: For program point L2491(line 2491) no Hoare annotation was computed. [2022-12-13 14:27:45,984 INFO L899 garLoopResultBuilder]: For program point L2574(line 2574) no Hoare annotation was computed. [2022-12-13 14:27:45,984 INFO L895 garLoopResultBuilder]: At program point isl6271a_probe_ldv_19989#1(lines 2310 2376) the Hoare annotation is: (let ((.cse0 (<= ~ref_cnt~0 0)) (.cse1 (<= 0 ~ref_cnt~0)) (.cse2 (= ~ldv_state_variable_1~0 1)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse2 .cse3))) [2022-12-13 14:27:45,984 INFO L895 garLoopResultBuilder]: At program point isl6271a_init_returnLabel#1(lines 2414 2420) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)) [2022-12-13 14:27:45,984 INFO L902 garLoopResultBuilder]: At program point L3136(line 3136) the Hoare annotation is: true [2022-12-13 14:27:45,984 INFO L895 garLoopResultBuilder]: At program point PTR_ERR_returnLabel#1(lines 2166 2171) the Hoare annotation is: (let ((.cse0 (<= ~ref_cnt~0 0)) (.cse1 (<= 0 ~ref_cnt~0)) (.cse2 (= ~ldv_state_variable_1~0 1)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse2 .cse3))) [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L3136-1(lines 3125 3143) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L2492(lines 2492 2497) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L2525(lines 2525 2561) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L2327(lines 2327 2330) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L2261(lines 2261 2264) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L2261-2(lines 2261 2264) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L2542(line 2542) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L895 garLoopResultBuilder]: At program point regulator_register_returnLabel#1(lines 3211 3213) the Hoare annotation is: (let ((.cse0 (<= ~ref_cnt~0 0)) (.cse1 (<= 0 ~ref_cnt~0)) (.cse2 (= ~ldv_state_variable_1~0 1)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse2 .cse3))) [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L2476(line 2476) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L2476-1(line 2476) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L2278(lines 2278 2281) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L2278-2(lines 2278 2281) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2466) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L2460(lines 2460 2482) no Hoare annotation was computed. [2022-12-13 14:27:45,985 INFO L899 garLoopResultBuilder]: For program point L2543(lines 2543 2547) no Hoare annotation was computed. [2022-12-13 14:27:45,986 INFO L899 garLoopResultBuilder]: For program point L2345-1(line 2345) no Hoare annotation was computed. [2022-12-13 14:27:45,986 INFO L895 garLoopResultBuilder]: At program point L2345(line 2345) the Hoare annotation is: (let ((.cse0 (<= ~ref_cnt~0 0)) (.cse1 (<= 0 ~ref_cnt~0)) (.cse2 (= ~ldv_state_variable_1~0 1)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse2 .cse3))) [2022-12-13 14:27:45,986 INFO L895 garLoopResultBuilder]: At program point isl6271a_remove_ldv_20000#1(lines 2382 2398) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 2)) (.cse1 (<= 1 ~ref_cnt~0)) (.cse2 (= ~ldv_state_variable_0~0 3)) (.cse3 (<= ~ref_cnt~0 1))) (or (and .cse0 (= |ULTIMATE.start_isl6271a_remove_~i~1#1| 0) .cse1 .cse2 .cse3) (and (<= |ULTIMATE.start_isl6271a_remove_~i~1#1| 2) (<= 1 |ULTIMATE.start_isl6271a_remove_~i~1#1|) .cse0 .cse1 .cse2 .cse3))) [2022-12-13 14:27:45,986 INFO L895 garLoopResultBuilder]: At program point i2c_register_driver_returnLabel#1(lines 3179 3181) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)) [2022-12-13 14:27:45,986 INFO L899 garLoopResultBuilder]: For program point L2527(lines 2527 2558) no Hoare annotation was computed. [2022-12-13 14:27:45,986 INFO L899 garLoopResultBuilder]: For program point L2461(line 2461) no Hoare annotation was computed. [2022-12-13 14:27:45,986 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2466) no Hoare annotation was computed. [2022-12-13 14:27:45,986 INFO L895 garLoopResultBuilder]: At program point i2c_smbus_write_byte_returnLabel#1(lines 3187 3189) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-12-13 14:27:45,986 INFO L899 garLoopResultBuilder]: For program point L2346(lines 2346 2352) no Hoare annotation was computed. [2022-12-13 14:27:45,986 INFO L899 garLoopResultBuilder]: For program point L2528(line 2528) no Hoare annotation was computed. [2022-12-13 14:27:45,986 INFO L899 garLoopResultBuilder]: For program point L2462(lines 2462 2470) no Hoare annotation was computed. [2022-12-13 14:27:45,986 INFO L899 garLoopResultBuilder]: For program point L3173-1(line 3173) no Hoare annotation was computed. [2022-12-13 14:27:45,986 INFO L902 garLoopResultBuilder]: At program point L3140(line 3140) the Hoare annotation is: true [2022-12-13 14:27:45,987 INFO L895 garLoopResultBuilder]: At program point L3173(line 3173) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-12-13 14:27:45,987 INFO L902 garLoopResultBuilder]: At program point L3140-1(lines 3123 3144) the Hoare annotation is: true [2022-12-13 14:27:45,987 INFO L899 garLoopResultBuilder]: For program point L3201-1(line 3201) no Hoare annotation was computed. [2022-12-13 14:27:45,987 INFO L899 garLoopResultBuilder]: For program point rdev_get_drvdataEXIT(lines 3200 3202) no Hoare annotation was computed. [2022-12-13 14:27:45,987 INFO L895 garLoopResultBuilder]: At program point L3201(line 3201) the Hoare annotation is: (let ((.cse2 (not (<= 0 ~ref_cnt~0))) (.cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~ldv_state_variable_0~0 3))) (.cse3 (not (<= ~ref_cnt~0 0)))) (and (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse0 .cse1 (not (<= ~ref_cnt~0 1))) (or (not (= ~ldv_state_variable_1~0 0)) .cse2 .cse0 .cse3) (or .cse2 (not (= ~ldv_state_variable_1~0 1)) .cse0 .cse1 .cse3))) [2022-12-13 14:27:45,987 INFO L899 garLoopResultBuilder]: For program point rdev_get_drvdataFINAL(lines 3200 3202) no Hoare annotation was computed. [2022-12-13 14:27:45,987 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 3200 3202) the Hoare annotation is: (let ((.cse2 (not (<= 0 ~ref_cnt~0))) (.cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~ldv_state_variable_0~0 3))) (.cse3 (not (<= ~ref_cnt~0 0)))) (and (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse0 .cse1 (not (<= ~ref_cnt~0 1))) (or (not (= ~ldv_state_variable_1~0 0)) .cse2 .cse0 .cse3) (or .cse2 (not (= ~ldv_state_variable_1~0 1)) .cse0 .cse1 .cse3))) [2022-12-13 14:27:45,987 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 2172 2178) no Hoare annotation was computed. [2022-12-13 14:27:45,988 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2172 2178) the Hoare annotation is: true [2022-12-13 14:27:45,988 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 2172 2178) no Hoare annotation was computed. [2022-12-13 14:27:45,988 INFO L902 garLoopResultBuilder]: At program point ldv__builtin_expect_returnLabel#1(lines 2691 2696) the Hoare annotation is: true [2022-12-13 14:27:45,990 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:27:45,991 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 14:27:46,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:27:46 BoogieIcfgContainer [2022-12-13 14:27:46,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 14:27:46,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:27:46,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:27:46,014 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:27:46,014 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:27:31" (3/4) ... [2022-12-13 14:27:46,017 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 14:27:46,023 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2022-12-13 14:27:46,023 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_mtx_of_isl_pmic [2022-12-13 14:27:46,023 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-12-13 14:27:46,023 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-12-13 14:27:46,024 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_unregister [2022-12-13 14:27:46,024 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2022-12-13 14:27:46,024 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_mtx_of_isl_pmic [2022-12-13 14:27:46,024 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rdev_get_drvdata [2022-12-13 14:27:46,024 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_list_voltage_linear [2022-12-13 14:27:46,024 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2022-12-13 14:27:46,035 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 83 nodes and edges [2022-12-13 14:27:46,036 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-12-13 14:27:46,037 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-13 14:27:46,038 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 14:27:46,038 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 14:27:46,151 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 14:27:46,151 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:27:46,151 INFO L158 Benchmark]: Toolchain (without parser) took 16487.41ms. Allocated memory was 136.3MB in the beginning and 245.4MB in the end (delta: 109.1MB). Free memory was 82.8MB in the beginning and 192.1MB in the end (delta: -109.3MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2022-12-13 14:27:46,152 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 136.3MB. Free memory was 100.9MB in the beginning and 100.9MB in the end (delta: 21.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:27:46,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 696.89ms. Allocated memory was 136.3MB in the beginning and 203.4MB in the end (delta: 67.1MB). Free memory was 82.5MB in the beginning and 124.1MB in the end (delta: -41.5MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2022-12-13 14:27:46,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.35ms. Allocated memory is still 203.4MB. Free memory was 124.1MB in the beginning and 117.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 14:27:46,152 INFO L158 Benchmark]: Boogie Preprocessor took 62.08ms. Allocated memory is still 203.4MB. Free memory was 117.8MB in the beginning and 113.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 14:27:46,153 INFO L158 Benchmark]: RCFGBuilder took 785.50ms. Allocated memory is still 203.4MB. Free memory was 113.6MB in the beginning and 155.9MB in the end (delta: -42.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2022-12-13 14:27:46,153 INFO L158 Benchmark]: TraceAbstraction took 14723.27ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 154.9MB in the beginning and 173.1MB in the end (delta: -18.2MB). Peak memory consumption was 144.1MB. Max. memory is 16.1GB. [2022-12-13 14:27:46,153 INFO L158 Benchmark]: Witness Printer took 137.81ms. Allocated memory is still 245.4MB. Free memory was 173.1MB in the beginning and 192.1MB in the end (delta: -19.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 14:27:46,154 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.11ms. Allocated memory is still 136.3MB. Free memory was 100.9MB in the beginning and 100.9MB in the end (delta: 21.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 696.89ms. Allocated memory was 136.3MB in the beginning and 203.4MB in the end (delta: 67.1MB). Free memory was 82.5MB in the beginning and 124.1MB in the end (delta: -41.5MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.35ms. Allocated memory is still 203.4MB. Free memory was 124.1MB in the beginning and 117.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.08ms. Allocated memory is still 203.4MB. Free memory was 117.8MB in the beginning and 113.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 785.50ms. Allocated memory is still 203.4MB. Free memory was 113.6MB in the beginning and 155.9MB in the end (delta: -42.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14723.27ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 154.9MB in the beginning and 173.1MB in the end (delta: -18.2MB). Peak memory consumption was 144.1MB. Max. memory is 16.1GB. * Witness Printer took 137.81ms. Allocated memory is still 245.4MB. Free memory was 173.1MB in the beginning and 192.1MB in the end (delta: -19.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2353]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2353]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2368]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2368]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2466]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2466]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2389]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2389]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2476]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2476]: 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 11 procedures, 192 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3697 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3535 mSDsluCounter, 9899 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5506 mSDsCounter, 573 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1548 IncrementalHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 573 mSolverCounterUnsat, 4393 mSDtfsCounter, 1548 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 607 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred in iteration=11, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 2430 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 1214 PreInvPairs, 1340 NumberOfFragments, 1518 HoareAnnotationTreeSize, 1214 FomulaSimplifications, 17796 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 76 FomulaSimplificationsInter, 17850 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1465 NumberOfCodeBlocks, 1465 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1532 ConstructedInterpolants, 0 QuantifiedInterpolants, 2644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5366 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 710/748 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 10 specifications checked. All of them hold - InvariantResult [Line: 2229]: Loop Invariant Derived loop invariant: (((ref_cnt <= 0 && 1 <= i) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: (((((ref_cnt <= 0 && 1 <= i) && i <= 2) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) || ((((ref_cnt <= 0 && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2691]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2238]: Loop Invariant Derived loop invariant: ((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2391]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && i == 0) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((((1 <= i && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: ((((ref_cnt <= 0 && i <= 2) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && 0 <= i) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2378]: Loop Invariant Derived loop invariant: (((1 <= i && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 3187]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2252]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2447]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3211]: Loop Invariant Derived loop invariant: (((((ref_cnt <= 0 && 1 <= i) && i <= 2) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) || ((((ref_cnt <= 0 && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2659]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 3145]: Loop Invariant Derived loop invariant: ((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: (((ref_cnt <= 0 && 1 <= i) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 3169]: Loop Invariant Derived loop invariant: (((ref_cnt <= 0 && 1 <= i) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 3208]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2447]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2245]: Loop Invariant Derived loop invariant: ((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: ((((ref_cnt <= 0 && i <= 2) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && 0 <= i) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2651]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3172]: Loop Invariant Derived loop invariant: ((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 3175]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2382]: Loop Invariant Derived loop invariant: (((1 <= i && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 2269]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2299]: Loop Invariant Derived loop invariant: ((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2222]: Loop Invariant Derived loop invariant: ((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 3123]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2166]: Loop Invariant Derived loop invariant: (((((ref_cnt <= 0 && 1 <= i) && i <= 2) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) || ((((ref_cnt <= 0 && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2441]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2382]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && i == 0) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((((i <= 2 && 1 <= i) && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: ((i + 1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2355]: Loop Invariant Derived loop invariant: ((((ref_cnt <= 0 && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) || ((((ref_cnt <= 0 && 1 <= i) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2667]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 3183]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2675]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 3179]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ref_cnt == 0 - InvariantResult [Line: 2414]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ref_cnt == 0 - InvariantResult [Line: 3165]: Loop Invariant Derived loop invariant: ((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 3113]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ref_cnt == 0 RESULT: Ultimate proved your program to be correct! [2022-12-13 14:27:46,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8d04269-a8d3-4506-9907-2601807634d1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE