./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-10 02:40:29,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:40:29,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 02:40:29,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:40:29,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:40:29,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:40:29,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:40:29,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:40:29,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:40:29,436 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:40:29,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:40:29,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:40:29,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:40:29,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:40:29,436 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:40:29,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:40:29,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:40:29,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:40:29,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:40:29,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:40:29,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:40:29,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:40:29,436 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:40:29,436 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:40:29,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:40:29,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:40:29,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:40:29,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:40:29,438 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-jdk21/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-01-10 02:40:29,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:40:29,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:40:29,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:40:29,659 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:40:29,660 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:40:29,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/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-01-10 02:40:30,787 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ebe00721/dfc0eb2cb57b4126820ba29ed1b13ff3/FLAGe6388e36d [2025-01-10 02:40:31,146 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:40:31,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/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-01-10 02:40:31,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ebe00721/dfc0eb2cb57b4126820ba29ed1b13ff3/FLAGe6388e36d [2025-01-10 02:40:31,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ebe00721/dfc0eb2cb57b4126820ba29ed1b13ff3 [2025-01-10 02:40:31,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:40:31,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:40:31,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:40:31,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:40:31,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:40:31,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:31,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d31ac5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31, skipping insertion in model container [2025-01-10 02:40:31,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:31,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:40:31,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:40:31,778 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:40:31,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:40:31,879 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:40:31,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31 WrapperNode [2025-01-10 02:40:31,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:40:31,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:40:31,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:40:31,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:40:31,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:31,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:31,934 INFO L138 Inliner]: procedures = 84, calls = 179, calls flagged for inlining = 34, calls inlined = 27, statements flattened = 565 [2025-01-10 02:40:31,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:40:31,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:40:31,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:40:31,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:40:31,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:31,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:31,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:31,992 INFO L175 MemorySlicer]: Split 55 memory accesses to 4 slices as follows [2, 27, 4, 22]. 49 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 0, 4, 0]. The 35 writes are split as follows [0, 13, 0, 22]. [2025-01-10 02:40:31,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:31,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:32,006 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:32,008 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:32,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:32,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:32,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:32,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:40:32,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:40:32,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:40:32,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:40:32,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (1/1) ... [2025-01-10 02:40:32,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:40:32,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:32,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 02:40:32,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 02:40:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2025-01-10 02:40:32,089 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2025-01-10 02:40:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_probe [2025-01-10 02:40:32,089 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_probe [2025-01-10 02:40:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:40:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-10 02:40:32,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-10 02:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-10 02:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-10 02:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-10 02:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-10 02:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 02:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 02:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 02:40:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 02:40:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-10 02:40:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-10 02:40:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-10 02:40:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-10 02:40:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-10 02:40:32,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-10 02:40:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:40:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:40:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:40:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:40:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-10 02:40:32,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-10 02:40:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 02:40:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 02:40:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 02:40:32,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 02:40:32,093 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-01-10 02:40:32,093 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-01-10 02:40:32,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-10 02:40:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-10 02:40:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2025-01-10 02:40:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2025-01-10 02:40:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2025-01-10 02:40:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-10 02:40:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2025-01-10 02:40:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 02:40:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove [2025-01-10 02:40:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2025-01-10 02:40:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:40:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:40:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2025-01-10 02:40:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2025-01-10 02:40:32,095 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-01-10 02:40:32,095 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-01-10 02:40:32,247 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:40:32,249 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:40:32,506 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-10 02:40:36,445 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2025-01-10 02:40:36,445 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:40:36,454 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:40:36,455 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 02:40:36,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:36 BoogieIcfgContainer [2025-01-10 02:40:36,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:40:36,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:40:36,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:40:36,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:40:36,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:40:31" (1/3) ... [2025-01-10 02:40:36,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1932ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:36, skipping insertion in model container [2025-01-10 02:40:36,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:31" (2/3) ... [2025-01-10 02:40:36,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1932ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:36, skipping insertion in model container [2025-01-10 02:40:36,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:36" (3/3) ... [2025-01-10 02:40:36,461 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-01-10 02:40:36,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:40:36,472 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, 256 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-01-10 02:40:36,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:40:36,515 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;@12ba97c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:40:36,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 02:40:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 255 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 196 states have internal predecessors, (234), 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-01-10 02:40:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 02:40:36,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:36,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:36,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:36,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:36,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1395805340, now seen corresponding path program 1 times [2025-01-10 02:40:36,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:36,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114863197] [2025-01-10 02:40:36,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:36,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:36,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 02:40:36,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 02:40:36,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:36,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:36,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:36,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114863197] [2025-01-10 02:40:36,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114863197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:36,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:36,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:40:36,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254022065] [2025-01-10 02:40:36,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:36,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:36,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:36,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:36,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:36,907 INFO L87 Difference]: Start difference. First operand has 255 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 196 states have internal predecessors, (234), 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.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-01-10 02:40:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:36,979 INFO L93 Difference]: Finished difference Result 532 states and 700 transitions. [2025-01-10 02:40:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:36,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 21 [2025-01-10 02:40:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:36,988 INFO L225 Difference]: With dead ends: 532 [2025-01-10 02:40:36,988 INFO L226 Difference]: Without dead ends: 256 [2025-01-10 02:40:36,993 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-01-10 02:40:36,995 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 35 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:36,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 626 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:37,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-10 02:40:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-01-10 02:40:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 179 states have (on average 1.329608938547486) internal successors, (238), 197 states have internal predecessors, (238), 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-01-10 02:40:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2025-01-10 02:40:37,036 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 21 [2025-01-10 02:40:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:37,036 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2025-01-10 02:40:37,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-01-10 02:40:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2025-01-10 02:40:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 02:40:37,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:37,040 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, 1, 1, 1, 1] [2025-01-10 02:40:37,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:40:37,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:37,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:37,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1840605303, now seen corresponding path program 1 times [2025-01-10 02:40:37,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:37,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534370712] [2025-01-10 02:40:37,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:37,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 02:40:37,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 02:40:37,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:37,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:40:37,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:37,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534370712] [2025-01-10 02:40:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534370712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:37,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:37,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:40:37,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775061965] [2025-01-10 02:40:37,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:37,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:37,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:37,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:37,321 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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-01-10 02:40:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:37,389 INFO L93 Difference]: Finished difference Result 509 states and 649 transitions. [2025-01-10 02:40:37,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:37,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 45 [2025-01-10 02:40:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:37,394 INFO L225 Difference]: With dead ends: 509 [2025-01-10 02:40:37,394 INFO L226 Difference]: Without dead ends: 503 [2025-01-10 02:40:37,394 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-01-10 02:40:37,395 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 268 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:37,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 638 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-01-10 02:40:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 493. [2025-01-10 02:40:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 355 states have (on average 1.315492957746479) internal successors, (467), 376 states have internal predecessors, (467), 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-01-10 02:40:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 643 transitions. [2025-01-10 02:40:37,435 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 643 transitions. Word has length 45 [2025-01-10 02:40:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:37,436 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 643 transitions. [2025-01-10 02:40:37,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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-01-10 02:40:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 643 transitions. [2025-01-10 02:40:37,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 02:40:37,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:37,438 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, 1, 1, 1, 1] [2025-01-10 02:40:37,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:40:37,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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-01-10 02:40:37,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:37,439 INFO L85 PathProgramCache]: Analyzing trace with hash 339756034, now seen corresponding path program 1 times [2025-01-10 02:40:37,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:37,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971033319] [2025-01-10 02:40:37,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:37,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:37,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 02:40:37,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 02:40:37,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:37,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:40:37,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:37,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971033319] [2025-01-10 02:40:37,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971033319] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:37,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028713283] [2025-01-10 02:40:37,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:37,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:37,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:37,779 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:37,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 02:40:37,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 02:40:37,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 02:40:37,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:37,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:37,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 02:40:37,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:40:38,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:38,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028713283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:38,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:38,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-01-10 02:40:38,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257352309] [2025-01-10 02:40:38,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:38,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:38,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:38,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:38,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:38,047 INFO L87 Difference]: Start difference. First operand 493 states and 643 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 02:40:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:38,095 INFO L93 Difference]: Finished difference Result 1168 states and 1518 transitions. [2025-01-10 02:40:38,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:38,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2025-01-10 02:40:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:38,099 INFO L225 Difference]: With dead ends: 1168 [2025-01-10 02:40:38,099 INFO L226 Difference]: Without dead ends: 678 [2025-01-10 02:40:38,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:38,101 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 222 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 615 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-01-10 02:40:38,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 615 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-01-10 02:40:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 666. [2025-01-10 02:40:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 487 states have (on average 1.3100616016427105) internal successors, (638), 511 states have internal predecessors, (638), 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-01-10 02:40:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 870 transitions. [2025-01-10 02:40:38,130 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 870 transitions. Word has length 66 [2025-01-10 02:40:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:38,132 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 870 transitions. [2025-01-10 02:40:38,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 02:40:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 870 transitions. [2025-01-10 02:40:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 02:40:38,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:38,133 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, 1, 1, 1, 1] [2025-01-10 02:40:38,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:40:38,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:38,334 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:38,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:38,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1036098836, now seen corresponding path program 1 times [2025-01-10 02:40:38,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:38,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846810409] [2025-01-10 02:40:38,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:38,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:38,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:40:38,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:40:38,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:38,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 02:40:38,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:38,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846810409] [2025-01-10 02:40:38,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846810409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:38,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:38,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:40:38,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148886546] [2025-01-10 02:40:38,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:38,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:38,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:38,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:38,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:38,518 INFO L87 Difference]: Start difference. First operand 666 states and 870 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-01-10 02:40:40,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:40:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:40,955 INFO L93 Difference]: Finished difference Result 1208 states and 1565 transitions. [2025-01-10 02:40:40,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:40,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 64 [2025-01-10 02:40:40,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:40,960 INFO L225 Difference]: With dead ends: 1208 [2025-01-10 02:40:40,960 INFO L226 Difference]: Without dead ends: 751 [2025-01-10 02:40:40,961 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-01-10 02:40:40,962 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 99 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:40,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 632 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-10 02:40:40,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-01-10 02:40:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 749. [2025-01-10 02:40:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 547 states have (on average 1.3016453382084094) internal successors, (712), 571 states have internal predecessors, (712), 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-01-10 02:40:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 968 transitions. [2025-01-10 02:40:40,998 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 968 transitions. Word has length 64 [2025-01-10 02:40:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:40,998 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 968 transitions. [2025-01-10 02:40:40,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-01-10 02:40:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 968 transitions. [2025-01-10 02:40:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 02:40:41,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:41,001 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] [2025-01-10 02:40:41,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:40:41,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:41,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1498552765, now seen corresponding path program 1 times [2025-01-10 02:40:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:41,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879712524] [2025-01-10 02:40:41,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:41,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:41,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 02:40:41,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 02:40:41,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:41,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 02:40:41,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:41,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879712524] [2025-01-10 02:40:41,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879712524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:41,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:41,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:40:41,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695598322] [2025-01-10 02:40:41,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:41,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:41,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:41,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:41,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:41,179 INFO L87 Difference]: Start difference. First operand 749 states and 968 transitions. Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-01-10 02:40:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:41,251 INFO L93 Difference]: Finished difference Result 1597 states and 2101 transitions. [2025-01-10 02:40:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:41,252 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), 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 84 [2025-01-10 02:40:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:41,256 INFO L225 Difference]: With dead ends: 1597 [2025-01-10 02:40:41,257 INFO L226 Difference]: Without dead ends: 851 [2025-01-10 02:40:41,259 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-01-10 02:40:41,259 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 31 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 579 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-01-10 02:40:41,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 579 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-01-10 02:40:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2025-01-10 02:40:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 628 states have (on average 1.305732484076433) internal successors, (820), 652 states have internal predecessors, (820), 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-01-10 02:40:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1118 transitions. [2025-01-10 02:40:41,302 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1118 transitions. Word has length 84 [2025-01-10 02:40:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:41,302 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1118 transitions. [2025-01-10 02:40:41,302 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), 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-01-10 02:40:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1118 transitions. [2025-01-10 02:40:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 02:40:41,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:41,304 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, 1, 1, 1, 1] [2025-01-10 02:40:41,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:40:41,305 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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-01-10 02:40:41,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1585295532, now seen corresponding path program 1 times [2025-01-10 02:40:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304875164] [2025-01-10 02:40:41,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:41,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:41,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 02:40:41,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 02:40:41,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:41,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 02:40:41,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:41,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304875164] [2025-01-10 02:40:41,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304875164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:41,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:41,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:40:41,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121180238] [2025-01-10 02:40:41,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:41,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:41,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:41,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:41,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:41,479 INFO L87 Difference]: Start difference. First operand 851 states and 1118 transitions. Second operand has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 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-01-10 02:40:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:41,541 INFO L93 Difference]: Finished difference Result 1467 states and 1928 transitions. [2025-01-10 02:40:41,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:41,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 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 86 [2025-01-10 02:40:41,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:41,547 INFO L225 Difference]: With dead ends: 1467 [2025-01-10 02:40:41,548 INFO L226 Difference]: Without dead ends: 859 [2025-01-10 02:40:41,549 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-01-10 02:40:41,551 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 593 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-01-10 02:40:41,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 593 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-01-10 02:40:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2025-01-10 02:40:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 634 states have (on average 1.3028391167192428) internal successors, (826), 658 states have internal predecessors, (826), 151 states have call successors, (151), 58 states have call predecessors, (151), 58 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2025-01-10 02:40:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1128 transitions. [2025-01-10 02:40:41,587 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1128 transitions. Word has length 86 [2025-01-10 02:40:41,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:41,589 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1128 transitions. [2025-01-10 02:40:41,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 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-01-10 02:40:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1128 transitions. [2025-01-10 02:40:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-10 02:40:41,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:41,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:41,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:40:41,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:41,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1975038011, now seen corresponding path program 1 times [2025-01-10 02:40:41,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:41,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419303496] [2025-01-10 02:40:41,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:41,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:41,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 02:40:41,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 02:40:41,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:41,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 02:40:41,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:41,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419303496] [2025-01-10 02:40:41,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419303496] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:41,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201550008] [2025-01-10 02:40:41,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:41,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:41,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:41,737 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:41,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 02:40:41,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 02:40:41,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 02:40:41,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:41,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:41,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:41,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 02:40:42,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:42,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201550008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:42,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:42,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:40:42,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841224283] [2025-01-10 02:40:42,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:42,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:42,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:42,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:42,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:42,029 INFO L87 Difference]: Start difference. First operand 859 states and 1128 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:42,121 INFO L93 Difference]: Finished difference Result 1715 states and 2262 transitions. [2025-01-10 02:40:42,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:42,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2025-01-10 02:40:42,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:42,128 INFO L225 Difference]: With dead ends: 1715 [2025-01-10 02:40:42,128 INFO L226 Difference]: Without dead ends: 859 [2025-01-10 02:40:42,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 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-01-10 02:40:42,133 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 62 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:42,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 860 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:40:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-01-10 02:40:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2025-01-10 02:40:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 637 states have (on average 1.2872841444270016) internal successors, (820), 658 states have internal predecessors, (820), 151 states have call successors, (151), 58 states have call predecessors, (151), 58 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2025-01-10 02:40:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1122 transitions. [2025-01-10 02:40:42,172 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1122 transitions. Word has length 89 [2025-01-10 02:40:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:42,173 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1122 transitions. [2025-01-10 02:40:42,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1122 transitions. [2025-01-10 02:40:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 02:40:42,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:42,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:42,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 02:40:42,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:42,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:42,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:42,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1096636396, now seen corresponding path program 1 times [2025-01-10 02:40:42,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:42,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698874033] [2025-01-10 02:40:42,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:42,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:42,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 02:40:42,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 02:40:42,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:42,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 02:40:42,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:42,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698874033] [2025-01-10 02:40:42,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698874033] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:42,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406577440] [2025-01-10 02:40:42,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:42,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:42,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:42,558 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:42,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 02:40:42,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 02:40:42,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 02:40:42,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:42,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:42,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:42,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 02:40:42,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:40:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 02:40:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406577440] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:40:42,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:40:42,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:40:42,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572662902] [2025-01-10 02:40:42,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:40:42,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:40:42,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:42,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:40:42,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:42,925 INFO L87 Difference]: Start difference. First operand 859 states and 1122 transitions. Second operand has 7 states, 6 states have (on average 13.0) internal successors, (78), 7 states have internal predecessors, (78), 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-01-10 02:40:43,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:43,046 INFO L93 Difference]: Finished difference Result 979 states and 1311 transitions. [2025-01-10 02:40:43,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:40:43,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.0) internal successors, (78), 7 states have internal predecessors, (78), 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 90 [2025-01-10 02:40:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:43,052 INFO L225 Difference]: With dead ends: 979 [2025-01-10 02:40:43,052 INFO L226 Difference]: Without dead ends: 976 [2025-01-10 02:40:43,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 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-01-10 02:40:43,053 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 277 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:43,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 588 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:40:43,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-01-10 02:40:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2025-01-10 02:40:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 628 states have (on average 1.2770700636942676) internal successors, (802), 646 states have internal predecessors, (802), 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-01-10 02:40:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1098 transitions. [2025-01-10 02:40:43,081 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1098 transitions. Word has length 90 [2025-01-10 02:40:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:43,081 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1098 transitions. [2025-01-10 02:40:43,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.0) internal successors, (78), 7 states have internal predecessors, (78), 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-01-10 02:40:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1098 transitions. [2025-01-10 02:40:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 02:40:43,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:43,083 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, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:43,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:40:43,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:43,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:43,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:43,284 INFO L85 PathProgramCache]: Analyzing trace with hash 294154553, now seen corresponding path program 2 times [2025-01-10 02:40:43,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:43,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397032242] [2025-01-10 02:40:43,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:40:43,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:43,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-01-10 02:40:43,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 88 statements. [2025-01-10 02:40:43,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:40:43,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-10 02:40:43,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:43,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397032242] [2025-01-10 02:40:43,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397032242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:43,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:43,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:40:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274290585] [2025-01-10 02:40:43,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:43,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:40:43,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:43,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:40:43,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:43,374 INFO L87 Difference]: Start difference. First operand 844 states and 1098 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-01-10 02:40:44,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:40:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:44,852 INFO L93 Difference]: Finished difference Result 2303 states and 2989 transitions. [2025-01-10 02:40:44,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:40:44,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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 88 [2025-01-10 02:40:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:44,859 INFO L225 Difference]: With dead ends: 2303 [2025-01-10 02:40:44,860 INFO L226 Difference]: Without dead ends: 1697 [2025-01-10 02:40:44,861 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-01-10 02:40:44,862 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 288 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:44,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1978 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-10 02:40:44,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-01-10 02:40:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 856. [2025-01-10 02:40:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 637 states have (on average 1.2731554160125589) internal successors, (811), 655 states have internal predecessors, (811), 148 states have call successors, (148), 58 states have call predecessors, (148), 61 states have return successors, (151), 151 states have call predecessors, (151), 148 states have call successors, (151) [2025-01-10 02:40:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1110 transitions. [2025-01-10 02:40:44,898 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1110 transitions. Word has length 88 [2025-01-10 02:40:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:44,898 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1110 transitions. [2025-01-10 02:40:44,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-01-10 02:40:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1110 transitions. [2025-01-10 02:40:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 02:40:44,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:44,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:44,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:40:44,899 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:44,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:44,900 INFO L85 PathProgramCache]: Analyzing trace with hash 645846163, now seen corresponding path program 1 times [2025-01-10 02:40:44,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:44,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638649437] [2025-01-10 02:40:44,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:44,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:44,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 02:40:44,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 02:40:44,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:44,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 02:40:45,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:45,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638649437] [2025-01-10 02:40:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638649437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:45,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:45,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:40:45,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38756418] [2025-01-10 02:40:45,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:45,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:45,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:45,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:45,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:45,076 INFO L87 Difference]: Start difference. First operand 856 states and 1110 transitions. Second operand has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 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-01-10 02:40:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:45,124 INFO L93 Difference]: Finished difference Result 1703 states and 2226 transitions. [2025-01-10 02:40:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:45,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 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 96 [2025-01-10 02:40:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:45,132 INFO L225 Difference]: With dead ends: 1703 [2025-01-10 02:40:45,132 INFO L226 Difference]: Without dead ends: 1701 [2025-01-10 02:40:45,132 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-01-10 02:40:45,133 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 232 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 628 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-01-10 02:40:45,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 628 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2025-01-10 02:40:45,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1693. [2025-01-10 02:40:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1265 states have (on average 1.2703557312252964) internal successors, (1607), 1292 states have internal predecessors, (1607), 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-01-10 02:40:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2220 transitions. [2025-01-10 02:40:45,224 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2220 transitions. Word has length 96 [2025-01-10 02:40:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:45,224 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2220 transitions. [2025-01-10 02:40:45,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 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-01-10 02:40:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2220 transitions. [2025-01-10 02:40:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 02:40:45,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:45,225 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, 1, 1, 1, 1, 1] [2025-01-10 02:40:45,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:40:45,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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-01-10 02:40:45,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:45,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1018333311, now seen corresponding path program 1 times [2025-01-10 02:40:45,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:45,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871025639] [2025-01-10 02:40:45,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:45,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:45,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 02:40:45,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 02:40:45,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:45,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-10 02:40:45,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:45,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871025639] [2025-01-10 02:40:45,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871025639] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:45,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738783809] [2025-01-10 02:40:45,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:45,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:45,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:45,334 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:45,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 02:40:45,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 02:40:45,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 02:40:45,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:45,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:45,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:40:45,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 02:40:45,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:45,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738783809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:45,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:45,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-01-10 02:40:45,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307920689] [2025-01-10 02:40:45,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:45,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:40:45,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:45,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:40:45,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:45,614 INFO L87 Difference]: Start difference. First operand 1693 states and 2220 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-01-10 02:40:46,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:40:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:47,101 INFO L93 Difference]: Finished difference Result 4617 states and 6041 transitions. [2025-01-10 02:40:47,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:40:47,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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 105 [2025-01-10 02:40:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:47,114 INFO L225 Difference]: With dead ends: 4617 [2025-01-10 02:40:47,114 INFO L226 Difference]: Without dead ends: 3403 [2025-01-10 02:40:47,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 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-01-10 02:40:47,118 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 288 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:47,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1978 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-10 02:40:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2025-01-10 02:40:47,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 1693. [2025-01-10 02:40:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1265 states have (on average 1.2703557312252964) internal successors, (1607), 1292 states have internal predecessors, (1607), 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-01-10 02:40:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2220 transitions. [2025-01-10 02:40:47,214 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2220 transitions. Word has length 105 [2025-01-10 02:40:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:47,214 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2220 transitions. [2025-01-10 02:40:47,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-01-10 02:40:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2220 transitions. [2025-01-10 02:40:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-10 02:40:47,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:47,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:47,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:40:47,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 02:40:47,418 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:47,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash 16949659, now seen corresponding path program 1 times [2025-01-10 02:40:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:47,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762095047] [2025-01-10 02:40:47,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:47,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-10 02:40:47,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-10 02:40:47,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:47,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:47,765 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 02:40:47,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:47,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762095047] [2025-01-10 02:40:47,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762095047] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:47,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933846007] [2025-01-10 02:40:47,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:47,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:47,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:47,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:47,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 02:40:48,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-10 02:40:48,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-10 02:40:48,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:48,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:48,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:40:48,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 02:40:48,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:48,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933846007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:48,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:48,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 11 [2025-01-10 02:40:48,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951828433] [2025-01-10 02:40:48,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:48,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:40:48,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:48,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:40:48,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:40:48,474 INFO L87 Difference]: Start difference. First operand 1693 states and 2220 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-10 02:40:49,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:40:51,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:40:52,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:52,184 INFO L93 Difference]: Finished difference Result 1713 states and 2229 transitions. [2025-01-10 02:40:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:40:52,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 115 [2025-01-10 02:40:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:52,189 INFO L225 Difference]: With dead ends: 1713 [2025-01-10 02:40:52,190 INFO L226 Difference]: Without dead ends: 842 [2025-01-10 02:40:52,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 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-01-10 02:40:52,192 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 328 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:52,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 490 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-10 02:40:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-01-10 02:40:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2025-01-10 02:40:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 625 states have (on average 1.264) internal successors, (790), 641 states have internal predecessors, (790), 148 states have call successors, (148), 58 states have call predecessors, (148), 61 states have return successors, (151), 151 states have call predecessors, (151), 148 states have call successors, (151) [2025-01-10 02:40:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1089 transitions. [2025-01-10 02:40:52,233 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1089 transitions. Word has length 115 [2025-01-10 02:40:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:52,234 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1089 transitions. [2025-01-10 02:40:52,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-10 02:40:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1089 transitions. [2025-01-10 02:40:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-10 02:40:52,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:52,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:52,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:40:52,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 02:40:52,440 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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-01-10 02:40:52,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:52,441 INFO L85 PathProgramCache]: Analyzing trace with hash 765441500, now seen corresponding path program 1 times [2025-01-10 02:40:52,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:52,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21142898] [2025-01-10 02:40:52,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:52,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:52,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-10 02:40:52,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-10 02:40:52,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:52,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:40:52,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:52,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21142898] [2025-01-10 02:40:52,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21142898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:52,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:52,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:40:52,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645062725] [2025-01-10 02:40:52,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:52,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:52,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:52,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:52,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:40:52,579 INFO L87 Difference]: Start difference. First operand 842 states and 1089 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-01-10 02:40:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:52,624 INFO L93 Difference]: Finished difference Result 1681 states and 2178 transitions. [2025-01-10 02:40:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:52,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 130 [2025-01-10 02:40:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:52,628 INFO L225 Difference]: With dead ends: 1681 [2025-01-10 02:40:52,628 INFO L226 Difference]: Without dead ends: 842 [2025-01-10 02:40:52,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:40:52,631 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 0 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:52,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 851 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-01-10 02:40:52,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2025-01-10 02:40:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 625 states have (on average 1.2592) internal successors, (787), 638 states have internal predecessors, (787), 148 states have call successors, (148), 58 states have call predecessors, (148), 61 states have return successors, (151), 151 states have call predecessors, (151), 148 states have call successors, (151) [2025-01-10 02:40:52,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1086 transitions. [2025-01-10 02:40:52,669 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1086 transitions. Word has length 130 [2025-01-10 02:40:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:52,669 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1086 transitions. [2025-01-10 02:40:52,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-01-10 02:40:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1086 transitions. [2025-01-10 02:40:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-10 02:40:52,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:52,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:52,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 02:40:52,672 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:52,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:52,673 INFO L85 PathProgramCache]: Analyzing trace with hash 927396327, now seen corresponding path program 1 times [2025-01-10 02:40:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:52,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643909953] [2025-01-10 02:40:52,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:52,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-10 02:40:52,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-10 02:40:52,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:52,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-10 02:40:52,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643909953] [2025-01-10 02:40:52,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643909953] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868277956] [2025-01-10 02:40:52,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:52,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:52,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:52,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:52,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 02:40:53,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-10 02:40:53,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-10 02:40:53,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:53,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:53,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:53,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-10 02:40:53,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:53,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868277956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:53,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:53,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:40:53,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036725784] [2025-01-10 02:40:53,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:53,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:53,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:53,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:53,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:53,210 INFO L87 Difference]: Start difference. First operand 842 states and 1086 transitions. Second operand has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-10 02:40:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:53,255 INFO L93 Difference]: Finished difference Result 842 states and 1086 transitions. [2025-01-10 02:40:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:53,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2025-01-10 02:40:53,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:53,261 INFO L225 Difference]: With dead ends: 842 [2025-01-10 02:40:53,261 INFO L226 Difference]: Without dead ends: 841 [2025-01-10 02:40:53,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 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-01-10 02:40:53,262 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 1 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:53,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 844 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-01-10 02:40:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2025-01-10 02:40:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 625 states have (on average 1.256) internal successors, (785), 637 states have internal predecessors, (785), 148 states have call successors, (148), 58 states have call predecessors, (148), 61 states have return successors, (151), 151 states have call predecessors, (151), 148 states have call successors, (151) [2025-01-10 02:40:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1084 transitions. [2025-01-10 02:40:53,308 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1084 transitions. Word has length 134 [2025-01-10 02:40:53,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:53,308 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1084 transitions. [2025-01-10 02:40:53,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-10 02:40:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1084 transitions. [2025-01-10 02:40:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-10 02:40:53,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:53,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:53,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 02:40:53,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 02:40:53,511 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:53,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:53,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1315484659, now seen corresponding path program 1 times [2025-01-10 02:40:53,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:53,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398728567] [2025-01-10 02:40:53,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:53,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:53,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-10 02:40:53,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-10 02:40:53,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:53,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:53,647 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-10 02:40:53,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:53,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398728567] [2025-01-10 02:40:53,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398728567] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:53,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244012072] [2025-01-10 02:40:53,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:53,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:53,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:53,650 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:53,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 02:40:53,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-10 02:40:53,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-10 02:40:53,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:53,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:53,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:53,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-10 02:40:54,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:40:54,123 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-10 02:40:54,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244012072] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:40:54,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:40:54,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:40:54,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100437894] [2025-01-10 02:40:54,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:40:54,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:40:54,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:54,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:40:54,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:54,125 INFO L87 Difference]: Start difference. First operand 841 states and 1084 transitions. Second operand has 7 states, 6 states have (on average 15.5) internal successors, (93), 7 states have internal predecessors, (93), 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-01-10 02:40:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:54,173 INFO L93 Difference]: Finished difference Result 851 states and 1102 transitions. [2025-01-10 02:40:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:40:54,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 7 states have internal predecessors, (93), 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 135 [2025-01-10 02:40:54,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:54,178 INFO L225 Difference]: With dead ends: 851 [2025-01-10 02:40:54,178 INFO L226 Difference]: Without dead ends: 850 [2025-01-10 02:40:54,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 266 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-01-10 02:40:54,180 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:54,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 561 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-01-10 02:40:54,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 834. [2025-01-10 02:40:54,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 621 states have (on average 1.2544283413848631) internal successors, (779), 632 states have internal predecessors, (779), 146 states have call successors, (146), 58 states have call predecessors, (146), 61 states have return successors, (149), 149 states have call predecessors, (149), 146 states have call successors, (149) [2025-01-10 02:40:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1074 transitions. [2025-01-10 02:40:54,219 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1074 transitions. Word has length 135 [2025-01-10 02:40:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:54,219 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1074 transitions. [2025-01-10 02:40:54,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 7 states have internal predecessors, (93), 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-01-10 02:40:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1074 transitions. [2025-01-10 02:40:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-10 02:40:54,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:54,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:54,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 02:40:54,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:54,422 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:54,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:54,422 INFO L85 PathProgramCache]: Analyzing trace with hash -518761339, now seen corresponding path program 1 times [2025-01-10 02:40:54,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:54,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393750415] [2025-01-10 02:40:54,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:54,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-10 02:40:54,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-10 02:40:54,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:54,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 02:40:54,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:54,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393750415] [2025-01-10 02:40:54,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393750415] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:54,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619285350] [2025-01-10 02:40:54,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:54,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:54,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:54,552 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:54,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 02:40:54,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-10 02:40:54,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-10 02:40:54,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:54,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:54,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:54,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 02:40:55,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:55,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619285350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:55,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:55,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:40:55,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645677453] [2025-01-10 02:40:55,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:55,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:55,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:55,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:55,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:55,039 INFO L87 Difference]: Start difference. First operand 834 states and 1074 transitions. Second operand has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 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-01-10 02:40:56,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:40:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:56,969 INFO L93 Difference]: Finished difference Result 836 states and 1078 transitions. [2025-01-10 02:40:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:56,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 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 136 [2025-01-10 02:40:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:56,973 INFO L225 Difference]: With dead ends: 836 [2025-01-10 02:40:56,973 INFO L226 Difference]: Without dead ends: 833 [2025-01-10 02:40:56,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 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-01-10 02:40:56,974 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 396 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:56,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 652 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-10 02:40:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-01-10 02:40:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 831. [2025-01-10 02:40:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 621 states have (on average 1.249597423510467) internal successors, (776), 629 states have internal predecessors, (776), 146 states have call successors, (146), 58 states have call predecessors, (146), 61 states have return successors, (149), 149 states have call predecessors, (149), 146 states have call successors, (149) [2025-01-10 02:40:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1071 transitions. [2025-01-10 02:40:57,013 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1071 transitions. Word has length 136 [2025-01-10 02:40:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:57,014 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1071 transitions. [2025-01-10 02:40:57,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 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-01-10 02:40:57,014 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1071 transitions. [2025-01-10 02:40:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-10 02:40:57,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:57,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:57,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 02:40:57,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 02:40:57,216 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:57,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:57,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1098268033, now seen corresponding path program 1 times [2025-01-10 02:40:57,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:57,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376763881] [2025-01-10 02:40:57,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:57,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-10 02:40:57,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-10 02:40:57,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:57,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 02:40:57,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:57,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376763881] [2025-01-10 02:40:57,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376763881] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:57,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983080603] [2025-01-10 02:40:57,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:57,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:57,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:57,435 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:57,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 02:40:57,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-10 02:40:57,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-10 02:40:57,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:57,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:57,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:57,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 02:40:57,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:40:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 02:40:58,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983080603] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:40:58,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:40:58,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:40:58,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404871400] [2025-01-10 02:40:58,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:40:58,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:40:58,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:58,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:40:58,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:58,118 INFO L87 Difference]: Start difference. First operand 831 states and 1071 transitions. Second operand has 7 states, 6 states have (on average 35.333333333333336) internal successors, (212), 7 states have internal predecessors, (212), 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-01-10 02:40:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:58,764 INFO L93 Difference]: Finished difference Result 1422 states and 1833 transitions. [2025-01-10 02:40:58,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:40:58,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 35.333333333333336) internal successors, (212), 7 states have internal predecessors, (212), 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 137 [2025-01-10 02:40:58,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:58,771 INFO L225 Difference]: With dead ends: 1422 [2025-01-10 02:40:58,771 INFO L226 Difference]: Without dead ends: 1419 [2025-01-10 02:40:58,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 270 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-01-10 02:40:58,772 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1014 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:58,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 892 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 02:40:58,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2025-01-10 02:40:58,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1182. [2025-01-10 02:40:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 883 states have (on average 1.2434881087202718) internal successors, (1098), 891 states have internal predecessors, (1098), 208 states have call successors, (208), 86 states have call predecessors, (208), 90 states have return successors, (212), 212 states have call predecessors, (212), 208 states have call successors, (212) [2025-01-10 02:40:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1518 transitions. [2025-01-10 02:40:58,851 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1518 transitions. Word has length 137 [2025-01-10 02:40:58,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:58,851 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1518 transitions. [2025-01-10 02:40:58,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 35.333333333333336) internal successors, (212), 7 states have internal predecessors, (212), 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-01-10 02:40:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1518 transitions. [2025-01-10 02:40:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-10 02:40:58,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:58,854 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-01-10 02:40:58,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 02:40:59,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:59,054 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 02:40:59,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:59,055 INFO L85 PathProgramCache]: Analyzing trace with hash -984186485, now seen corresponding path program 1 times [2025-01-10 02:40:59,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:59,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590187558] [2025-01-10 02:40:59,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:59,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:59,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-10 02:40:59,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-10 02:40:59,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:59,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-01-10 02:40:59,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:59,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590187558] [2025-01-10 02:40:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590187558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:59,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:59,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:40:59,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318290980] [2025-01-10 02:40:59,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:59,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:59,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:59,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:59,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:59,210 INFO L87 Difference]: Start difference. First operand 1182 states and 1518 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-10 02:41:03,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:41:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:41:03,247 INFO L93 Difference]: Finished difference Result 1513 states and 1940 transitions. [2025-01-10 02:41:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:41:03,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 231 [2025-01-10 02:41:03,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:41:03,249 INFO L225 Difference]: With dead ends: 1513 [2025-01-10 02:41:03,249 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:41:03,252 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-01-10 02:41:03,252 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 242 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:41:03,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 305 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-10 02:41:03,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:41:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:41:03,253 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-01-10 02:41:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:41:03,253 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 231 [2025-01-10 02:41:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:41:03,253 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:41:03,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-10 02:41:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:41:03,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-01-10 02:41:03,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-01-10 02:41:03,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 02:41:03,259 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:41:03,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:41:08,390 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:41:08,401 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-01-10 02:41:08,402 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-01-10 02:41:08,402 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-01-10 02:41:08,405 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-01-10 02:41:08,405 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-01-10 02:41:08,405 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-01-10 02:41:08,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:41:08 BoogieIcfgContainer [2025-01-10 02:41:08,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:41:08,406 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:41:08,407 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:41:08,407 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:41:08,408 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:36" (3/4) ... [2025-01-10 02:41:08,409 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:41:08,415 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_probe [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file [2025-01-10 02:41:08,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2025-01-10 02:41:08,431 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2025-01-10 02:41:08,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-01-10 02:41:08,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-10 02:41:08,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 02:41:08,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:41:08,457 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) && (ldv_count_2 == 0)) [2025-01-10 02:41:08,458 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_count_1 <= 0) && (0 <= i)) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (i <= 2147483645)) && (ldv_state_variable_0 == 2)) && (ldv_count_2 == 0)) [2025-01-10 02:41:08,460 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && ((ldv_count_2 == 0) || (ldv_count_2 == 0))) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) [2025-01-10 02:41:08,462 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && ((ldv_count_2 == 0) || (ldv_count_2 == 0))) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) [2025-01-10 02:41:08,510 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && ((ldv_count_2 == 0) || (ldv_count_2 == 0))) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) [2025-01-10 02:41:08,511 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_count_1 <= 0) && (0 <= i)) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (i <= 2147483645)) && (ldv_state_variable_0 == 2)) && (ldv_count_2 == 0)) [2025-01-10 02:41:08,511 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && ((ldv_count_2 == 0) || (ldv_count_2 == 0))) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) [2025-01-10 02:41:08,511 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) && (ldv_count_2 == 0)) [2025-01-10 02:41:08,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:41:08,546 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:41:08,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:41:08,547 INFO L158 Benchmark]: Toolchain (without parser) took 37152.10ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 107.9MB in the beginning and 258.1MB in the end (delta: -150.1MB). Peak memory consumption was 275.9MB. Max. memory is 16.1GB. [2025-01-10 02:41:08,547 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:41:08,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.88ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 77.8MB in the end (delta: 30.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 02:41:08,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.16ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 73.5MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:41:08,548 INFO L158 Benchmark]: Boogie Preprocessor took 84.03ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 64.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:41:08,549 INFO L158 Benchmark]: RCFGBuilder took 4435.49ms. Allocated memory is still 142.6MB. Free memory was 64.2MB in the beginning and 76.8MB in the end (delta: -12.5MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2025-01-10 02:41:08,550 INFO L158 Benchmark]: TraceAbstraction took 31949.54ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 76.1MB in the beginning and 270.5MB in the end (delta: -194.4MB). Peak memory consumption was 311.0MB. Max. memory is 16.1GB. [2025-01-10 02:41:08,550 INFO L158 Benchmark]: Witness Printer took 139.85ms. Allocated memory is still 570.4MB. Free memory was 270.5MB in the beginning and 258.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:41:08,551 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 485.88ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 77.8MB in the end (delta: 30.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.16ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 73.5MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 84.03ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 64.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 4435.49ms. Allocated memory is still 142.6MB. Free memory was 64.2MB in the beginning and 76.8MB in the end (delta: -12.5MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * TraceAbstraction took 31949.54ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 76.1MB in the beginning and 270.5MB in the end (delta: -194.4MB). Peak memory consumption was 311.0MB. Max. memory is 16.1GB. * Witness Printer took 139.85ms. Allocated memory is still 570.4MB. Free memory was 270.5MB in the beginning and 258.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. 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: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 256 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 26.8s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 3833 SdHoareTripleChecker+Valid, 15.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3784 mSDsluCounter, 14310 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8185 mSDsCounter, 366 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1098 IncrementalHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 366 mSolverCounterUnsat, 6125 mSDtfsCounter, 1098 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1426 GetRequests, 1364 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1693occurred in iteration=10, InterpolantAutomatonStates: 79, 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, 2970 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2859 NumberOfCodeBlocks, 2792 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3191 ConstructedInterpolants, 0 QuantifiedInterpolants, 5360 SizeOfPredicates, 3 NumberOfNonLiveVariables, 7508 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 30 InterpolantComputations, 15 PerfectInterpolantSequences, 1025/1101 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: 1115]: Location Invariant Derived location invariant: (((((((((ldv_count_1 <= 0) && (0 <= i)) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (i <= 2147483645)) && (ldv_state_variable_0 == 2)) && (ldv_count_2 == 0)) - InvariantResult [Line: 1155]: Location Invariant Derived location invariant: (((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && ((i == 0) || ((i <= 2147483645) && (1 <= i)))) && (1 <= ref_cnt)) && (ldv_count_2 == 0)) && (ref_cnt <= 1)) - InvariantResult [Line: 1053]: Location Invariant Derived location invariant: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) && (ldv_count_2 == 0)) - InvariantResult [Line: 1015]: Loop Invariant Derived loop invariant: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && ((ldv_count_2 == 0) || (ldv_count_2 == 0))) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && ((ldv_count_2 == 0) || (ldv_count_2 == 0))) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) RESULT: Ultimate proved your program to be correct! [2025-01-10 02:41:08,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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