./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 88f19b088f98626e870666f9633d9e7e34156d2b7ba315c9b1bc3979a22f8d34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:52:19,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:52:19,477 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 15:52:19,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:52:19,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:52:19,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:52:19,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:52:19,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:52:19,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:52:19,508 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:52:19,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:52:19,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:52:19,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:52:19,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:52:19,509 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:52:19,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:52:19,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:52:19,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:52:19,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:52:19,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:52:19,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:52:19,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:52:19,510 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:52:19,510 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:52:19,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:52:19,511 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:52:19,511 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:52:19,511 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:52:19,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:52:19,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:52:19,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:52:19,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:52:19,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:52:19,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:52:19,512 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:52:19,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:52:19,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:52:19,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:52:19,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:52:19,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:52:19,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:52:19,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:52:19,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 88f19b088f98626e870666f9633d9e7e34156d2b7ba315c9b1bc3979a22f8d34 [2025-03-17 15:52:19,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:52:19,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:52:19,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:52:19,719 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:52:19,719 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:52:19,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-03-17 15:52:20,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd0022c1/f78e33212c39473287445c9710ad6785/FLAG2880857e6 [2025-03-17 15:52:21,269 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:52:21,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-03-17 15:52:21,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd0022c1/f78e33212c39473287445c9710ad6785/FLAG2880857e6 [2025-03-17 15:52:21,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd0022c1/f78e33212c39473287445c9710ad6785 [2025-03-17 15:52:21,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:52:21,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:52:21,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:52:21,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:52:21,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:52:21,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:52:21" (1/1) ... [2025-03-17 15:52:21,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e06d52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:21, skipping insertion in model container [2025-03-17 15:52:21,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:52:21" (1/1) ... [2025-03-17 15:52:21,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:52:21,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:52:21,922 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:52:22,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:52:22,048 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:52:22,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22 WrapperNode [2025-03-17 15:52:22,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:52:22,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:52:22,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:52:22,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:52:22,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22" (1/1) ... [2025-03-17 15:52:22,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22" (1/1) ... [2025-03-17 15:52:22,109 INFO L138 Inliner]: procedures = 84, calls = 179, calls flagged for inlining = 34, calls inlined = 27, statements flattened = 565 [2025-03-17 15:52:22,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:52:22,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:52:22,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:52:22,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:52:22,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22" (1/1) ... [2025-03-17 15:52:22,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22" (1/1) ... [2025-03-17 15:52:22,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22" (1/1) ... [2025-03-17 15:52:22,166 INFO L175 MemorySlicer]: Split 55 memory accesses to 4 slices as follows [2, 4, 27, 22]. 49 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4, 0, 0]. The 35 writes are split as follows [0, 0, 13, 22]. [2025-03-17 15:52:22,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22" (1/1) ... [2025-03-17 15:52:22,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22" (1/1) ... [2025-03-17 15:52:22,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22" (1/1) ... [2025-03-17 15:52:22,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22" (1/1) ... [2025-03-17 15:52:22,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22" (1/1) ... [2025-03-17 15:52:22,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22" (1/1) ... [2025-03-17 15:52:22,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:52:22,221 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:52:22,221 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:52:22,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:52:22,222 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22" (1/1) ... [2025-03-17 15:52:22,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:52:22,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:22,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:52:22,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:52:22,284 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2025-03-17 15:52:22,284 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_probe [2025-03-17 15:52:22,285 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_probe [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-17 15:52:22,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 15:52:22,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-17 15:52:22,285 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-17 15:52:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-03-17 15:52:22,286 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-17 15:52:22,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 15:52:22,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2025-03-17 15:52:22,286 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2025-03-17 15:52:22,286 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2025-03-17 15:52:22,286 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-17 15:52:22,286 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2025-03-17 15:52:22,286 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2025-03-17 15:52:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 15:52:22,287 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 15:52:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:52:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 15:52:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 15:52:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 15:52:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove [2025-03-17 15:52:22,288 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove [2025-03-17 15:52:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 15:52:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2025-03-17 15:52:22,288 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2025-03-17 15:52:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:52:22,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:52:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2025-03-17 15:52:22,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2025-03-17 15:52:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-17 15:52:22,288 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-17 15:52:22,468 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:52:22,472 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:52:22,753 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1507: havoc s3c_adc_register_#t~ret145#1.base, s3c_adc_register_#t~ret145#1.offset; [2025-03-17 15:52:22,753 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1474: havoc dev_warn_#t~nondet140#1; [2025-03-17 15:52:22,753 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047: call ULTIMATE.dealloc(~#__key~0#1.base, ~#__key~0#1.offset);havoc ~#__key~0#1.base, ~#__key~0#1.offset; [2025-03-17 15:52:22,753 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1480: havoc hwmon_device_register_#t~ret141#1.base, hwmon_device_register_#t~ret141#1.offset; [2025-03-17 15:52:22,758 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 15:52:22,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1463: havoc dev_get_drvdata_#t~ret138#1.base, dev_get_drvdata_#t~ret138#1.offset; [2025-03-17 15:52:22,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1460: havoc #t~nondet137; [2025-03-17 15:52:24,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1497: havoc platform_driver_register_#t~nondet143#1; [2025-03-17 15:52:24,384 INFO L? ?]: Removed 200 outVars from TransFormulas that were not future-live. [2025-03-17 15:52:24,384 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:52:24,396 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:52:24,397 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:52:24,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:52:24 BoogieIcfgContainer [2025-03-17 15:52:24,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:52:24,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:52:24,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:52:24,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:52:24,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:52:21" (1/3) ... [2025-03-17 15:52:24,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f069da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:52:24, skipping insertion in model container [2025-03-17 15:52:24,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:52:22" (2/3) ... [2025-03-17 15:52:24,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f069da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:52:24, skipping insertion in model container [2025-03-17 15:52:24,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:52:24" (3/3) ... [2025-03-17 15:52:24,405 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-03-17 15:52:24,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:52:24,416 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i that has 19 procedures, 236 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-03-17 15:52:24,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:52:24,467 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@12b87b9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:52:24,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-17 15:52:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 153 states have (on average 1.3986928104575163) internal successors, (214), 176 states have internal predecessors, (214), 48 states have call successors, (48), 18 states have call predecessors, (48), 17 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 15:52:24,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 15:52:24,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:24,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:24,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:24,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:24,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1630302647, now seen corresponding path program 1 times [2025-03-17 15:52:24,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:24,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523933872] [2025-03-17 15:52:24,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:24,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:24,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:52:24,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:52:24,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:24,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:52:24,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:24,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523933872] [2025-03-17 15:52:24,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523933872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:24,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:24,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:52:24,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668344675] [2025-03-17 15:52:24,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:24,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:24,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:24,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:24,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:52:24,858 INFO L87 Difference]: Start difference. First operand has 235 states, 153 states have (on average 1.3986928104575163) internal successors, (214), 176 states have internal predecessors, (214), 48 states have call successors, (48), 18 states have call predecessors, (48), 17 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:52:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:24,921 INFO L93 Difference]: Finished difference Result 490 states and 658 transitions. [2025-03-17 15:52:24,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:24,923 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-03-17 15:52:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:24,934 INFO L225 Difference]: With dead ends: 490 [2025-03-17 15:52:24,934 INFO L226 Difference]: Without dead ends: 241 [2025-03-17 15:52:24,939 INFO L434 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 [2025-03-17 15:52:24,943 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 29 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:24,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 590 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:52:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-17 15:52:24,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-03-17 15:52:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 164 states have (on average 1.3597560975609757) internal successors, (223), 182 states have internal predecessors, (223), 44 states have call successors, (44), 17 states have call predecessors, (44), 17 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 15:52:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 311 transitions. [2025-03-17 15:52:25,002 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 311 transitions. Word has length 19 [2025-03-17 15:52:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:25,002 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 311 transitions. [2025-03-17 15:52:25,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:52:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 311 transitions. [2025-03-17 15:52:25,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 15:52:25,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:25,007 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:25,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:52:25,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:25,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:25,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1380831985, now seen corresponding path program 1 times [2025-03-17 15:52:25,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:25,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430000764] [2025-03-17 15:52:25,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:25,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:25,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 15:52:25,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 15:52:25,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:25,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:52:25,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:25,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430000764] [2025-03-17 15:52:25,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430000764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:25,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:25,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:52:25,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495728201] [2025-03-17 15:52:25,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:25,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:25,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:25,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:52:25,290 INFO L87 Difference]: Start difference. First operand 241 states and 311 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:52:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:25,373 INFO L93 Difference]: Finished difference Result 481 states and 621 transitions. [2025-03-17 15:52:25,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2025-03-17 15:52:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:25,379 INFO L225 Difference]: With dead ends: 481 [2025-03-17 15:52:25,380 INFO L226 Difference]: Without dead ends: 475 [2025-03-17 15:52:25,381 INFO L434 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 [2025-03-17 15:52:25,381 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 257 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:25,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 729 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:52:25,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-17 15:52:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 465. [2025-03-17 15:52:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 327 states have (on average 1.342507645259939) internal successors, (439), 348 states have internal predecessors, (439), 88 states have call successors, (88), 34 states have call predecessors, (88), 34 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-17 15:52:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 615 transitions. [2025-03-17 15:52:25,415 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 615 transitions. Word has length 41 [2025-03-17 15:52:25,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:25,416 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 615 transitions. [2025-03-17 15:52:25,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:52:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 615 transitions. [2025-03-17 15:52:25,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 15:52:25,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:25,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:25,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:52:25,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:25,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:25,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1824182246, now seen corresponding path program 1 times [2025-03-17 15:52:25,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:25,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940834111] [2025-03-17 15:52:25,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:25,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:25,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 15:52:25,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 15:52:25,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:25,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 15:52:25,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:25,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940834111] [2025-03-17 15:52:25,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940834111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:25,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049391874] [2025-03-17 15:52:25,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:25,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:25,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:25,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:25,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:52:25,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 15:52:25,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 15:52:25,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:25,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:25,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 15:52:25,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 15:52:25,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:52:25,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049391874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:25,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:52:25,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 15:52:25,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840899527] [2025-03-17 15:52:25,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:25,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:25,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:25,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:25,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:52:25,949 INFO L87 Difference]: Start difference. First operand 465 states and 615 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:52:25,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:25,986 INFO L93 Difference]: Finished difference Result 1101 states and 1451 transitions. [2025-03-17 15:52:25,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:25,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2025-03-17 15:52:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:25,992 INFO L225 Difference]: With dead ends: 1101 [2025-03-17 15:52:25,992 INFO L226 Difference]: Without dead ends: 637 [2025-03-17 15:52:25,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:52:25,994 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 212 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:25,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 704 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:52:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-17 15:52:26,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 625. [2025-03-17 15:52:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 446 states have (on average 1.3385650224215246) internal successors, (597), 470 states have internal predecessors, (597), 116 states have call successors, (116), 47 states have call predecessors, (116), 47 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-17 15:52:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 829 transitions. [2025-03-17 15:52:26,042 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 829 transitions. Word has length 62 [2025-03-17 15:52:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:26,042 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 829 transitions. [2025-03-17 15:52:26,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:52:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 829 transitions. [2025-03-17 15:52:26,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 15:52:26,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:26,044 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 15:52:26,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:52:26,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:26,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:26,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:26,246 INFO L85 PathProgramCache]: Analyzing trace with hash -769465655, now seen corresponding path program 1 times [2025-03-17 15:52:26,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:26,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437471497] [2025-03-17 15:52:26,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:26,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:26,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 15:52:26,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 15:52:26,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:26,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 15:52:26,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:26,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437471497] [2025-03-17 15:52:26,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437471497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:26,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:26,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:52:26,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412557000] [2025-03-17 15:52:26,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:26,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:26,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:26,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:26,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:52:26,416 INFO L87 Difference]: Start difference. First operand 625 states and 829 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:52:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:27,446 INFO L93 Difference]: Finished difference Result 1140 states and 1497 transitions. [2025-03-17 15:52:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:27,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 1 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 60 [2025-03-17 15:52:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:27,452 INFO L225 Difference]: With dead ends: 1140 [2025-03-17 15:52:27,452 INFO L226 Difference]: Without dead ends: 709 [2025-03-17 15:52:27,453 INFO L434 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 [2025-03-17 15:52:27,454 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 98 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:27,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 604 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 15:52:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-17 15:52:27,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 707. [2025-03-17 15:52:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 505 states have (on average 1.3267326732673268) internal successors, (670), 529 states have internal predecessors, (670), 128 states have call successors, (128), 58 states have call predecessors, (128), 58 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-17 15:52:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 926 transitions. [2025-03-17 15:52:27,491 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 926 transitions. Word has length 60 [2025-03-17 15:52:27,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:27,492 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 926 transitions. [2025-03-17 15:52:27,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:52:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 926 transitions. [2025-03-17 15:52:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 15:52:27,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:27,495 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:27,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:52:27,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:27,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1346859811, now seen corresponding path program 1 times [2025-03-17 15:52:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:27,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085521275] [2025-03-17 15:52:27,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:27,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:27,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 15:52:27,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 15:52:27,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:27,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 15:52:27,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:27,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085521275] [2025-03-17 15:52:27,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085521275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:27,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:27,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:52:27,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939119655] [2025-03-17 15:52:27,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:27,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:27,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:27,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:27,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:52:27,685 INFO L87 Difference]: Start difference. First operand 707 states and 926 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 15:52:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:27,754 INFO L93 Difference]: Finished difference Result 1509 states and 2013 transitions. [2025-03-17 15:52:27,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:27,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2025-03-17 15:52:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:27,761 INFO L225 Difference]: With dead ends: 1509 [2025-03-17 15:52:27,761 INFO L226 Difference]: Without dead ends: 803 [2025-03-17 15:52:27,763 INFO L434 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 [2025-03-17 15:52:27,764 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 29 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:27,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 549 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:52:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-17 15:52:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2025-03-17 15:52:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 580 states have (on average 1.3310344827586207) internal successors, (772), 604 states have internal predecessors, (772), 149 states have call successors, (149), 58 states have call predecessors, (149), 58 states have return successors, (149), 149 states have call predecessors, (149), 149 states have call successors, (149) [2025-03-17 15:52:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1070 transitions. [2025-03-17 15:52:27,809 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1070 transitions. Word has length 75 [2025-03-17 15:52:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:27,810 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1070 transitions. [2025-03-17 15:52:27,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 15:52:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1070 transitions. [2025-03-17 15:52:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 15:52:27,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:27,812 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:27,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:52:27,812 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:27,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:27,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1040935013, now seen corresponding path program 1 times [2025-03-17 15:52:27,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:27,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159060670] [2025-03-17 15:52:27,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:27,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:27,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 15:52:27,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 15:52:27,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:27,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 15:52:28,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159060670] [2025-03-17 15:52:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159060670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411931698] [2025-03-17 15:52:28,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:28,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:28,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:28,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:52:28,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 15:52:28,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 15:52:28,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:28,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:28,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:52:28,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 15:52:28,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:52:28,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411931698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:28,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:52:28,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-17 15:52:28,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510670807] [2025-03-17 15:52:28,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:28,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:52:28,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:28,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:52:28,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:52:28,376 INFO L87 Difference]: Start difference. First operand 803 states and 1070 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 15:52:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:28,465 INFO L93 Difference]: Finished difference Result 1605 states and 2148 transitions. [2025-03-17 15:52:28,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:52:28,465 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), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2025-03-17 15:52:28,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:28,471 INFO L225 Difference]: With dead ends: 1605 [2025-03-17 15:52:28,471 INFO L226 Difference]: Without dead ends: 803 [2025-03-17 15:52:28,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:52:28,474 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 59 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:28,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 578 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:52:28,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-17 15:52:28,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2025-03-17 15:52:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 583 states have (on average 1.313893653516295) internal successors, (766), 604 states have internal predecessors, (766), 149 states have call successors, (149), 58 states have call predecessors, (149), 58 states have return successors, (149), 149 states have call predecessors, (149), 149 states have call successors, (149) [2025-03-17 15:52:28,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1064 transitions. [2025-03-17 15:52:28,506 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1064 transitions. Word has length 80 [2025-03-17 15:52:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:28,506 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1064 transitions. [2025-03-17 15:52:28,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 15:52:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1064 transitions. [2025-03-17 15:52:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 15:52:28,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:28,508 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:28,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 15:52:28,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 15:52:28,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:28,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:28,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2090752949, now seen corresponding path program 1 times [2025-03-17 15:52:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:28,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189413737] [2025-03-17 15:52:28,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:28,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:28,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 15:52:28,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 15:52:28,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:28,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 15:52:28,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:28,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189413737] [2025-03-17 15:52:28,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189413737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:28,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139636353] [2025-03-17 15:52:28,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:28,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:28,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:28,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:28,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:52:29,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 15:52:29,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 15:52:29,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:29,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:29,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:52:29,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 15:52:29,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:52:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 15:52:29,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139636353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:52:29,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:52:29,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 15:52:29,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022990025] [2025-03-17 15:52:29,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:52:29,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:52:29,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:29,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:52:29,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:52:29,317 INFO L87 Difference]: Start difference. First operand 803 states and 1064 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 15:52:29,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:29,445 INFO L93 Difference]: Finished difference Result 917 states and 1247 transitions. [2025-03-17 15:52:29,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:52:29,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 81 [2025-03-17 15:52:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:29,452 INFO L225 Difference]: With dead ends: 917 [2025-03-17 15:52:29,452 INFO L226 Difference]: Without dead ends: 914 [2025-03-17 15:52:29,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:52:29,454 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 139 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:29,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 822 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:52:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-17 15:52:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 788. [2025-03-17 15:52:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 574 states have (on average 1.3031358885017421) internal successors, (748), 592 states have internal predecessors, (748), 146 states have call successors, (146), 58 states have call predecessors, (146), 58 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-17 15:52:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1040 transitions. [2025-03-17 15:52:29,493 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1040 transitions. Word has length 81 [2025-03-17 15:52:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:29,493 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1040 transitions. [2025-03-17 15:52:29,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 15:52:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1040 transitions. [2025-03-17 15:52:29,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 15:52:29,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:29,496 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:29,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 15:52:29,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:29,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:29,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:29,697 INFO L85 PathProgramCache]: Analyzing trace with hash 320696134, now seen corresponding path program 1 times [2025-03-17 15:52:29,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:29,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262064555] [2025-03-17 15:52:29,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:29,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:29,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 15:52:29,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 15:52:29,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:29,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:52:29,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:29,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262064555] [2025-03-17 15:52:29,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262064555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:29,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:29,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:52:29,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516397701] [2025-03-17 15:52:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:29,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:29,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:29,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:29,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:52:29,805 INFO L87 Difference]: Start difference. First operand 788 states and 1040 transitions. Second operand has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 15:52:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:29,843 INFO L93 Difference]: Finished difference Result 1361 states and 1799 transitions. [2025-03-17 15:52:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:29,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2025-03-17 15:52:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:29,848 INFO L225 Difference]: With dead ends: 1361 [2025-03-17 15:52:29,848 INFO L226 Difference]: Without dead ends: 796 [2025-03-17 15:52:29,850 INFO L434 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 [2025-03-17 15:52:29,850 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:29,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 553 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:52:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-17 15:52:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2025-03-17 15:52:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 580 states have (on average 1.3) internal successors, (754), 598 states have internal predecessors, (754), 148 states have call successors, (148), 58 states have call predecessors, (148), 58 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-17 15:52:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1050 transitions. [2025-03-17 15:52:29,884 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1050 transitions. Word has length 82 [2025-03-17 15:52:29,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:29,884 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1050 transitions. [2025-03-17 15:52:29,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 15:52:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1050 transitions. [2025-03-17 15:52:29,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 15:52:29,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:29,889 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:29,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:52:29,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:29,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:29,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1978175212, now seen corresponding path program 1 times [2025-03-17 15:52:29,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:29,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234652745] [2025-03-17 15:52:29,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:29,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:29,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 15:52:29,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 15:52:29,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:29,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 15:52:30,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:30,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234652745] [2025-03-17 15:52:30,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234652745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:30,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:30,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:52:30,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160999345] [2025-03-17 15:52:30,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:30,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:30,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:30,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:30,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:52:30,101 INFO L87 Difference]: Start difference. First operand 796 states and 1050 transitions. Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:52:30,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:30,142 INFO L93 Difference]: Finished difference Result 1585 states and 2108 transitions. [2025-03-17 15:52:30,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:30,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2025-03-17 15:52:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:30,151 INFO L225 Difference]: With dead ends: 1585 [2025-03-17 15:52:30,151 INFO L226 Difference]: Without dead ends: 1583 [2025-03-17 15:52:30,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:52:30,153 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 227 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:30,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 599 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:52:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-17 15:52:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1575. [2025-03-17 15:52:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1153 states have (on average 1.2966175195143106) internal successors, (1495), 1180 states have internal predecessors, (1495), 296 states have call successors, (296), 116 states have call predecessors, (296), 116 states have return successors, (311), 296 states have call predecessors, (311), 296 states have call successors, (311) [2025-03-17 15:52:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2102 transitions. [2025-03-17 15:52:30,218 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2102 transitions. Word has length 87 [2025-03-17 15:52:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:30,219 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2102 transitions. [2025-03-17 15:52:30,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:52:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2102 transitions. [2025-03-17 15:52:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 15:52:30,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:30,220 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 15:52:30,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:52:30,221 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:30,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:30,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1255612815, now seen corresponding path program 2 times [2025-03-17 15:52:30,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:30,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038830387] [2025-03-17 15:52:30,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:52:30,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:30,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-17 15:52:30,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 82 statements. [2025-03-17 15:52:30,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 15:52:30,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-17 15:52:30,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:30,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038830387] [2025-03-17 15:52:30,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038830387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:30,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:30,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:52:30,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945936844] [2025-03-17 15:52:30,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:30,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:52:30,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:30,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:52:30,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:52:30,329 INFO L87 Difference]: Start difference. First operand 1575 states and 2102 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:52:32,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 15:52:33,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 15:52:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:33,753 INFO L93 Difference]: Finished difference Result 4311 states and 5735 transitions. [2025-03-17 15:52:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:52:33,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 82 [2025-03-17 15:52:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:33,769 INFO L225 Difference]: With dead ends: 4311 [2025-03-17 15:52:33,770 INFO L226 Difference]: Without dead ends: 3175 [2025-03-17 15:52:33,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:52:33,775 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 276 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:33,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1529 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-17 15:52:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2025-03-17 15:52:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 1599. [2025-03-17 15:52:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1171 states have (on average 1.2920580700256192) internal successors, (1513), 1198 states have internal predecessors, (1513), 296 states have call successors, (296), 116 states have call predecessors, (296), 122 states have return successors, (317), 302 states have call predecessors, (317), 296 states have call successors, (317) [2025-03-17 15:52:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2126 transitions. [2025-03-17 15:52:33,887 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2126 transitions. Word has length 82 [2025-03-17 15:52:33,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:33,887 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2126 transitions. [2025-03-17 15:52:33,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:52:33,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2126 transitions. [2025-03-17 15:52:33,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 15:52:33,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:33,889 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 15:52:33,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 15:52:33,889 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:33,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash -553773059, now seen corresponding path program 1 times [2025-03-17 15:52:33,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:33,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971096044] [2025-03-17 15:52:33,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:33,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:33,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 15:52:33,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 15:52:33,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:33,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 15:52:34,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:34,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971096044] [2025-03-17 15:52:34,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971096044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:34,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:34,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:52:34,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164759731] [2025-03-17 15:52:34,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:34,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:34,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:34,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:34,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:52:34,013 INFO L87 Difference]: Start difference. First operand 1599 states and 2126 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-17 15:52:35,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 15:52:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:35,370 INFO L93 Difference]: Finished difference Result 2663 states and 3527 transitions. [2025-03-17 15:52:35,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:35,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 88 [2025-03-17 15:52:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:35,377 INFO L225 Difference]: With dead ends: 2663 [2025-03-17 15:52:35,377 INFO L226 Difference]: Without dead ends: 1013 [2025-03-17 15:52:35,382 INFO L434 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 [2025-03-17 15:52:35,382 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 246 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:35,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 303 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 15:52:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-03-17 15:52:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1013. [2025-03-17 15:52:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 729 states have (on average 1.2565157750342935) internal successors, (916), 748 states have internal predecessors, (916), 190 states have call successors, (190), 82 states have call predecessors, (190), 86 states have return successors, (204), 194 states have call predecessors, (204), 190 states have call successors, (204) [2025-03-17 15:52:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1310 transitions. [2025-03-17 15:52:35,448 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1310 transitions. Word has length 88 [2025-03-17 15:52:35,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:35,448 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1310 transitions. [2025-03-17 15:52:35,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-17 15:52:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1310 transitions. [2025-03-17 15:52:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 15:52:35,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:35,450 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:35,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 15:52:35,450 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:35,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1227198619, now seen corresponding path program 1 times [2025-03-17 15:52:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:35,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638355541] [2025-03-17 15:52:35,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:35,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 15:52:35,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 15:52:35,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:35,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 15:52:35,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:35,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638355541] [2025-03-17 15:52:35,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638355541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:35,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890069521] [2025-03-17 15:52:35,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:35,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:35,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:35,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:35,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:52:35,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 15:52:35,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 15:52:35,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:35,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:35,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:52:35,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:52:35,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:52:35,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890069521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:35,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:52:35,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-17 15:52:35,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337648195] [2025-03-17 15:52:35,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:35,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:52:35,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:35,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:52:35,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:52:35,870 INFO L87 Difference]: Start difference. First operand 1013 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 15:52:37,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 15:52:39,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 15:52:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:39,658 INFO L93 Difference]: Finished difference Result 2427 states and 3139 transitions. [2025-03-17 15:52:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:52:39,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2025-03-17 15:52:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:39,667 INFO L225 Difference]: With dead ends: 2427 [2025-03-17 15:52:39,667 INFO L226 Difference]: Without dead ends: 1835 [2025-03-17 15:52:39,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:52:39,670 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 215 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:39,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1330 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-17 15:52:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-03-17 15:52:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1405. [2025-03-17 15:52:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1009 states have (on average 1.2566897918731417) internal successors, (1268), 1038 states have internal predecessors, (1268), 270 states have call successors, (270), 112 states have call predecessors, (270), 118 states have return successors, (291), 272 states have call predecessors, (291), 270 states have call successors, (291) [2025-03-17 15:52:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1829 transitions. [2025-03-17 15:52:39,742 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1829 transitions. Word has length 100 [2025-03-17 15:52:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:39,743 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1829 transitions. [2025-03-17 15:52:39,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 15:52:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1829 transitions. [2025-03-17 15:52:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 15:52:39,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:39,745 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:39,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 15:52:39,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:39,946 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:39,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash 119708947, now seen corresponding path program 1 times [2025-03-17 15:52:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326441864] [2025-03-17 15:52:39,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:39,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 15:52:40,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 15:52:40,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:40,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 15:52:40,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:40,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326441864] [2025-03-17 15:52:40,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326441864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:40,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022375084] [2025-03-17 15:52:40,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:40,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:40,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:40,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:40,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:52:40,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 15:52:40,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 15:52:40,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:40,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:40,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:52:40,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 15:52:40,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:52:40,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022375084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:40,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:52:40,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 11 [2025-03-17 15:52:40,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228520878] [2025-03-17 15:52:40,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:40,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:52:40,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:40,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:52:40,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:52:40,900 INFO L87 Difference]: Start difference. First operand 1405 states and 1829 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 15:52:43,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 15:52:44,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 15:52:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:44,647 INFO L93 Difference]: Finished difference Result 1423 states and 1838 transitions. [2025-03-17 15:52:44,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:52:44,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 105 [2025-03-17 15:52:44,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:44,653 INFO L225 Difference]: With dead ends: 1423 [2025-03-17 15:52:44,653 INFO L226 Difference]: Without dead ends: 706 [2025-03-17 15:52:44,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:52:44,655 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 261 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:44,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 346 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-17 15:52:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-03-17 15:52:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2025-03-17 15:52:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 505 states have (on average 1.2514851485148515) internal successors, (632), 521 states have internal predecessors, (632), 136 states have call successors, (136), 56 states have call predecessors, (136), 59 states have return successors, (139), 137 states have call predecessors, (139), 136 states have call successors, (139) [2025-03-17 15:52:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 907 transitions. [2025-03-17 15:52:44,724 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 907 transitions. Word has length 105 [2025-03-17 15:52:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:44,724 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 907 transitions. [2025-03-17 15:52:44,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 15:52:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 907 transitions. [2025-03-17 15:52:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 15:52:44,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:44,726 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:44,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 15:52:44,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 15:52:44,927 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:44,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:44,928 INFO L85 PathProgramCache]: Analyzing trace with hash -514712723, now seen corresponding path program 1 times [2025-03-17 15:52:44,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:44,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199276797] [2025-03-17 15:52:44,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:44,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:44,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 15:52:44,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 15:52:44,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:44,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-17 15:52:45,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199276797] [2025-03-17 15:52:45,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199276797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474719215] [2025-03-17 15:52:45,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:45,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:45,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:45,078 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:45,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:52:45,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 15:52:45,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 15:52:45,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:45,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:45,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:52:45,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-17 15:52:45,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:52:45,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474719215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:45,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:52:45,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-17 15:52:45,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136437570] [2025-03-17 15:52:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:45,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:52:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:45,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:52:45,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:52:45,396 INFO L87 Difference]: Start difference. First operand 706 states and 907 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 15:52:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:45,434 INFO L93 Difference]: Finished difference Result 706 states and 907 transitions. [2025-03-17 15:52:45,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:52:45,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-17 15:52:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:45,439 INFO L225 Difference]: With dead ends: 706 [2025-03-17 15:52:45,439 INFO L226 Difference]: Without dead ends: 705 [2025-03-17 15:52:45,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:52:45,439 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:45,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 518 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:52:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-17 15:52:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2025-03-17 15:52:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 505 states have (on average 1.2495049504950495) internal successors, (631), 520 states have internal predecessors, (631), 136 states have call successors, (136), 56 states have call predecessors, (136), 59 states have return successors, (139), 137 states have call predecessors, (139), 136 states have call successors, (139) [2025-03-17 15:52:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 906 transitions. [2025-03-17 15:52:45,500 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 906 transitions. Word has length 120 [2025-03-17 15:52:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:45,500 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 906 transitions. [2025-03-17 15:52:45,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 15:52:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 906 transitions. [2025-03-17 15:52:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 15:52:45,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:45,501 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:45,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 15:52:45,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:45,702 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:45,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:45,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1223774936, now seen corresponding path program 1 times [2025-03-17 15:52:45,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:45,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534120915] [2025-03-17 15:52:45,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:45,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:45,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 15:52:45,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 15:52:45,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:45,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-17 15:52:45,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:45,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534120915] [2025-03-17 15:52:45,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534120915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:45,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:45,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:52:45,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303551726] [2025-03-17 15:52:45,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:45,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:45,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:45,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:45,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:52:45,828 INFO L87 Difference]: Start difference. First operand 705 states and 906 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 15:52:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:45,867 INFO L93 Difference]: Finished difference Result 1389 states and 1785 transitions. [2025-03-17 15:52:45,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:45,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2025-03-17 15:52:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:45,872 INFO L225 Difference]: With dead ends: 1389 [2025-03-17 15:52:45,872 INFO L226 Difference]: Without dead ends: 705 [2025-03-17 15:52:45,875 INFO L434 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 [2025-03-17 15:52:45,875 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:45,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:52:45,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-17 15:52:45,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2025-03-17 15:52:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 505 states have (on average 1.2435643564356436) internal successors, (628), 517 states have internal predecessors, (628), 136 states have call successors, (136), 56 states have call predecessors, (136), 59 states have return successors, (139), 137 states have call predecessors, (139), 136 states have call successors, (139) [2025-03-17 15:52:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 903 transitions. [2025-03-17 15:52:45,911 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 903 transitions. Word has length 121 [2025-03-17 15:52:45,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:45,913 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 903 transitions. [2025-03-17 15:52:45,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 15:52:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 903 transitions. [2025-03-17 15:52:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 15:52:45,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:45,915 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:45,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 15:52:45,915 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:45,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash -365764482, now seen corresponding path program 1 times [2025-03-17 15:52:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:45,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400262443] [2025-03-17 15:52:45,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:45,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 15:52:45,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 15:52:45,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:45,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-17 15:52:46,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400262443] [2025-03-17 15:52:46,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400262443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209867486] [2025-03-17 15:52:46,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:46,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:46,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:46,053 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:46,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:52:46,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 15:52:46,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 15:52:46,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:46,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:46,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:52:46,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-17 15:52:46,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:52:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-17 15:52:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209867486] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:52:46,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:52:46,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 15:52:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712638745] [2025-03-17 15:52:46,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:52:46,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:52:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:46,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:52:46,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:52:46,577 INFO L87 Difference]: Start difference. First operand 705 states and 903 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 15:52:46,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:46,629 INFO L93 Difference]: Finished difference Result 710 states and 912 transitions. [2025-03-17 15:52:46,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:52:46,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 125 [2025-03-17 15:52:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:46,633 INFO L225 Difference]: With dead ends: 710 [2025-03-17 15:52:46,633 INFO L226 Difference]: Without dead ends: 709 [2025-03-17 15:52:46,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:52:46,634 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 0 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:46,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 768 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:52:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-17 15:52:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 701. [2025-03-17 15:52:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 503 states have (on average 1.242544731610338) internal successors, (625), 514 states have internal predecessors, (625), 135 states have call successors, (135), 56 states have call predecessors, (135), 59 states have return successors, (138), 136 states have call predecessors, (138), 135 states have call successors, (138) [2025-03-17 15:52:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 898 transitions. [2025-03-17 15:52:46,671 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 898 transitions. Word has length 125 [2025-03-17 15:52:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:46,672 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 898 transitions. [2025-03-17 15:52:46,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 15:52:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 898 transitions. [2025-03-17 15:52:46,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 15:52:46,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:46,674 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:46,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 15:52:46,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:46,875 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:46,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:46,876 INFO L85 PathProgramCache]: Analyzing trace with hash -347597255, now seen corresponding path program 1 times [2025-03-17 15:52:46,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:46,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574688375] [2025-03-17 15:52:46,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:46,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:46,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 15:52:46,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 15:52:46,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:46,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 15:52:47,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:47,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574688375] [2025-03-17 15:52:47,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574688375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:47,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781981379] [2025-03-17 15:52:47,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:47,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:47,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:47,038 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:47,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 15:52:47,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 15:52:47,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 15:52:47,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:47,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:47,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:52:47,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 15:52:47,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:52:47,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781981379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:47,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:52:47,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-17 15:52:47,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574321215] [2025-03-17 15:52:47,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:47,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:52:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:47,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:52:47,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:52:47,563 INFO L87 Difference]: Start difference. First operand 701 states and 898 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 15:52:51,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 15:52:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:51,706 INFO L93 Difference]: Finished difference Result 701 states and 898 transitions. [2025-03-17 15:52:51,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:52:51,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2025-03-17 15:52:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:51,710 INFO L225 Difference]: With dead ends: 701 [2025-03-17 15:52:51,710 INFO L226 Difference]: Without dead ends: 699 [2025-03-17 15:52:51,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:52:51,710 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 205 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:51,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 448 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 15:52:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-17 15:52:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-03-17 15:52:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 503 states have (on average 1.2385685884691848) internal successors, (623), 512 states have internal predecessors, (623), 135 states have call successors, (135), 56 states have call predecessors, (135), 59 states have return successors, (138), 136 states have call predecessors, (138), 135 states have call successors, (138) [2025-03-17 15:52:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 896 transitions. [2025-03-17 15:52:51,744 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 896 transitions. Word has length 126 [2025-03-17 15:52:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:51,745 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 896 transitions. [2025-03-17 15:52:51,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 15:52:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 896 transitions. [2025-03-17 15:52:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 15:52:51,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:51,747 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:51,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 15:52:51,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 15:52:51,948 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 15:52:51,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:51,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2109387214, now seen corresponding path program 1 times [2025-03-17 15:52:51,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:51,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558624486] [2025-03-17 15:52:51,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:51,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:52,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 15:52:52,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 15:52:52,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:52,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 15:52:52,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:52,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558624486] [2025-03-17 15:52:52,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558624486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:52,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804049833] [2025-03-17 15:52:52,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:52,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:52,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:52,122 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:52,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 15:52:52,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 15:52:52,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 15:52:52,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:52,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:52,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:52:52,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 15:52:52,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:52:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 15:52:52,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804049833] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:52:52,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:52:52,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 3] total 6 [2025-03-17 15:52:52,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421790216] [2025-03-17 15:52:52,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:52:52,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:52:52,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:52,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:52:52,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:52:52,840 INFO L87 Difference]: Start difference. First operand 699 states and 896 transitions. Second operand has 7 states, 6 states have (on average 32.0) internal successors, (192), 7 states have internal predecessors, (192), 6 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2025-03-17 15:52:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:53,068 INFO L93 Difference]: Finished difference Result 699 states and 896 transitions. [2025-03-17 15:52:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:52:53,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 32.0) internal successors, (192), 7 states have internal predecessors, (192), 6 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) Word has length 127 [2025-03-17 15:52:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:53,071 INFO L225 Difference]: With dead ends: 699 [2025-03-17 15:52:53,071 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:52:53,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:52:53,073 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 499 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:53,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 473 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:52:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:52:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:52:53,074 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) [2025-03-17 15:52:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:52:53,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2025-03-17 15:52:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:53,075 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:52:53,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 32.0) internal successors, (192), 7 states have internal predecessors, (192), 6 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2025-03-17 15:52:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:52:53,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:52:53,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-03-17 15:52:53,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-17 15:52:53,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-17 15:52:53,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-03-17 15:52:53,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-17 15:52:53,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-17 15:52:53,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-17 15:52:53,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-17 15:52:53,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-17 15:52:53,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-17 15:52:53,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-17 15:52:53,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-17 15:52:53,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-17 15:52:53,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-17 15:52:53,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-17 15:52:53,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-17 15:52:53,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 15:52:53,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 15:52:53,284 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:53,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:52:58,808 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:52:58,815 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 15:52:58,817 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 15:52:58,817 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 15:52:58,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 15:52:58,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 15:52:58,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 15:52:58,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:52:58 BoogieIcfgContainer [2025-03-17 15:52:58,819 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:52:58,819 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:52:58,819 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:52:58,819 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:52:58,820 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:52:24" (3/4) ... [2025-03-17 15:52:58,822 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:52:58,827 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2025-03-17 15:52:58,827 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_probe [2025-03-17 15:52:58,827 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2025-03-17 15:52:58,827 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2025-03-17 15:52:58,827 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 15:52:58,827 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove [2025-03-17 15:52:58,827 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2025-03-17 15:52:58,827 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2025-03-17 15:52:58,827 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2025-03-17 15:52:58,827 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure dev_err [2025-03-17 15:52:58,828 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-17 15:52:58,828 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2025-03-17 15:52:58,828 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2025-03-17 15:52:58,828 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2025-03-17 15:52:58,828 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2025-03-17 15:52:58,828 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2025-03-17 15:52:58,828 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file [2025-03-17 15:52:58,828 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2025-03-17 15:52:58,844 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2025-03-17 15:52:58,845 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-17 15:52:58,845 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-17 15:52:58,846 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 15:52:58,847 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:52:58,873 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((probed_1 <= 0) && (ldv_count_2 == 0)) || ((probed_1 <= 0) && (ldv_count_2 == 0))) && (ldv_count_1 <= 0)) && (\old(ldv_count_2) == 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) [2025-03-17 15:52:58,874 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((probed_1 <= 0) && (ldv_count_2 == 0)) || ((probed_1 <= 0) && (ldv_count_2 == 0))) && (ldv_count_1 <= 0)) && (\old(ldv_count_2) == 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) [2025-03-17 15:52:58,918 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((probed_1 <= 0) && (ldv_count_2 == 0)) || ((probed_1 <= 0) && (ldv_count_2 == 0))) && (ldv_count_1 <= 0)) && (\old(ldv_count_2) == 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) [2025-03-17 15:52:58,918 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((probed_1 <= 0) && (ldv_count_2 == 0)) || ((probed_1 <= 0) && (ldv_count_2 == 0))) && (ldv_count_1 <= 0)) && (\old(ldv_count_2) == 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) [2025-03-17 15:52:58,948 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:52:58,949 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:52:58,949 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:52:58,949 INFO L158 Benchmark]: Toolchain (without parser) took 37457.55ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 102.9MB in the beginning and 309.0MB in the end (delta: -206.0MB). Peak memory consumption was 107.3MB. Max. memory is 16.1GB. [2025-03-17 15:52:58,950 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:52:58,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.59ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 72.4MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 15:52:58,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.76ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 68.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:52:58,950 INFO L158 Benchmark]: Boogie Preprocessor took 109.89ms. Allocated memory is still 142.6MB. Free memory was 68.3MB in the beginning and 59.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:52:58,950 INFO L158 Benchmark]: IcfgBuilder took 2176.05ms. Allocated memory is still 142.6MB. Free memory was 59.9MB in the beginning and 74.0MB in the end (delta: -14.1MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2025-03-17 15:52:58,951 INFO L158 Benchmark]: TraceAbstraction took 34420.28ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 73.3MB in the beginning and 321.6MB in the end (delta: -248.2MB). Peak memory consumption was 241.4MB. Max. memory is 16.1GB. [2025-03-17 15:52:58,951 INFO L158 Benchmark]: Witness Printer took 129.59ms. Allocated memory is still 453.0MB. Free memory was 321.6MB in the beginning and 309.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:52:58,952 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.59ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 72.4MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.76ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 68.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 109.89ms. Allocated memory is still 142.6MB. Free memory was 68.3MB in the beginning and 59.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 2176.05ms. Allocated memory is still 142.6MB. Free memory was 59.9MB in the beginning and 74.0MB in the end (delta: -14.1MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * TraceAbstraction took 34420.28ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 73.3MB in the beginning and 321.6MB in the end (delta: -248.2MB). Peak memory consumption was 241.4MB. Max. memory is 16.1GB. * Witness Printer took 129.59ms. Allocated memory is still 453.0MB. Free memory was 321.6MB in the beginning and 309.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 * 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: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 236 locations, 358 edges, 16 error locations. Started 1 CEGAR loops. OverallTime: 28.8s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2802 SdHoareTripleChecker+Valid, 17.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2754 mSDsluCounter, 11960 SdHoareTripleChecker+Invalid, 17.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6405 mSDsCounter, 268 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 743 IncrementalHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 268 mSolverCounterUnsat, 5555 mSDtfsCounter, 743 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1313 GetRequests, 1254 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1599occurred in iteration=10, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 2172 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2507 NumberOfCodeBlocks, 2444 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2810 ConstructedInterpolants, 0 QuantifiedInterpolants, 4825 SizeOfPredicates, 3 NumberOfNonLiveVariables, 6861 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 30 InterpolantComputations, 15 PerfectInterpolantSequences, 793/869 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 1002]: Location Invariant Derived location invariant: (((((((probed_1 <= 0) && (ldv_count_2 == 0)) || ((probed_1 <= 0) && (ldv_count_2 == 0))) && (ldv_count_1 <= 0)) && (\old(ldv_count_2) == 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) - InvariantResult [Line: 1015]: Location Invariant Derived location invariant: (((((((probed_1 <= 0) && (ldv_count_2 == 0)) || ((probed_1 <= 0) && (ldv_count_2 == 0))) && (ldv_count_1 <= 0)) && (\old(ldv_count_2) == 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:52:58,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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