./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 88f19b088f98626e870666f9633d9e7e34156d2b7ba315c9b1bc3979a22f8d34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:49:27,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:49:27,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 02:49:27,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:49:27,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:49:27,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:49:27,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:49:27,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:49:27,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:49:27,619 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:49:27,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:49:27,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:49:27,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:49:27,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:49:27,620 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:49:27,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:49:27,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:49:27,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:49:27,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:49:27,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:49:27,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:49:27,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:49:27,620 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:49:27,620 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:49:27,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:49:27,620 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:49:27,620 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:49:27,620 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:49:27,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:49:27,621 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 88f19b088f98626e870666f9633d9e7e34156d2b7ba315c9b1bc3979a22f8d34 [2025-03-09 02:49:27,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:49:27,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:49:27,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:49:27,886 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:49:27,887 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:49:27,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-03-09 02:49:29,067 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4a91cb8/fe35c40121f041c49a656acdcd4efacc/FLAG7a705fb85 [2025-03-09 02:49:29,443 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:49:29,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-03-09 02:49:29,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4a91cb8/fe35c40121f041c49a656acdcd4efacc/FLAG7a705fb85 [2025-03-09 02:49:29,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4a91cb8/fe35c40121f041c49a656acdcd4efacc [2025-03-09 02:49:29,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:49:29,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:49:29,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:49:29,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:49:29,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:49:29,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:49:29" (1/1) ... [2025-03-09 02:49:29,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c78adea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:29, skipping insertion in model container [2025-03-09 02:49:29,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:49:29" (1/1) ... [2025-03-09 02:49:29,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:49:30,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:49:30,050 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:49:30,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:49:30,158 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:49:30,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30 WrapperNode [2025-03-09 02:49:30,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:49:30,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:49:30,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:49:30,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:49:30,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30" (1/1) ... [2025-03-09 02:49:30,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30" (1/1) ... [2025-03-09 02:49:30,210 INFO L138 Inliner]: procedures = 84, calls = 179, calls flagged for inlining = 34, calls inlined = 27, statements flattened = 565 [2025-03-09 02:49:30,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:49:30,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:49:30,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:49:30,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:49:30,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30" (1/1) ... [2025-03-09 02:49:30,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30" (1/1) ... [2025-03-09 02:49:30,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30" (1/1) ... [2025-03-09 02:49:30,265 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-03-09 02:49:30,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30" (1/1) ... [2025-03-09 02:49:30,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30" (1/1) ... [2025-03-09 02:49:30,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30" (1/1) ... [2025-03-09 02:49:30,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30" (1/1) ... [2025-03-09 02:49:30,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30" (1/1) ... [2025-03-09 02:49:30,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30" (1/1) ... [2025-03-09 02:49:30,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:49:30,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:49:30,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:49:30,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:49:30,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30" (1/1) ... [2025-03-09 02:49:30,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:49:30,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:30,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:49:30,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:49:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2025-03-09 02:49:30,367 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2025-03-09 02:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_probe [2025-03-09 02:49:30,367 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_probe [2025-03-09 02:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-09 02:49:30,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-09 02:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-09 02:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-09 02:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-09 02:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-09 02:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 02:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 02:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 02:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-09 02:49:30,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-09 02:49:30,368 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-03-09 02:49:30,368 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-03-09 02:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-09 02:49:30,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-09 02:49:30,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2025-03-09 02:49:30,369 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2025-03-09 02:49:30,369 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2025-03-09 02:49:30,369 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-09 02:49:30,369 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2025-03-09 02:49:30,369 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 02:49:30,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove [2025-03-09 02:49:30,369 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2025-03-09 02:49:30,369 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:49:30,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2025-03-09 02:49:30,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2025-03-09 02:49:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-09 02:49:30,370 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-09 02:49:30,551 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:49:30,554 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:49:30,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1507: havoc s3c_adc_register_#t~ret145#1.base, s3c_adc_register_#t~ret145#1.offset; [2025-03-09 02:49:30,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1474: havoc dev_warn_#t~nondet140#1; [2025-03-09 02:49:30,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047: call ULTIMATE.dealloc(~#__key~0#1.base, ~#__key~0#1.offset);havoc ~#__key~0#1.base, ~#__key~0#1.offset; [2025-03-09 02:49:30,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1480: havoc hwmon_device_register_#t~ret141#1.base, hwmon_device_register_#t~ret141#1.offset; [2025-03-09 02:49:30,819 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-09 02:49:30,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1463: havoc dev_get_drvdata_#t~ret138#1.base, dev_get_drvdata_#t~ret138#1.offset; [2025-03-09 02:49:30,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1460: havoc #t~nondet137; [2025-03-09 02:49:32,206 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1497: havoc platform_driver_register_#t~nondet143#1; [2025-03-09 02:49:32,275 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2025-03-09 02:49:32,276 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:49:32,286 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:49:32,288 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:49:32,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:49:32 BoogieIcfgContainer [2025-03-09 02:49:32,289 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:49:32,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:49:32,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:49:32,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:49:32,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:49:29" (1/3) ... [2025-03-09 02:49:32,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6127cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:49:32, skipping insertion in model container [2025-03-09 02:49:32,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:30" (2/3) ... [2025-03-09 02:49:32,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6127cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:49:32, skipping insertion in model container [2025-03-09 02:49:32,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:49:32" (3/3) ... [2025-03-09 02:49:32,297 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-03-09 02:49:32,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:49:32,309 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-03-09 02:49:32,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:49:32,392 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;@65900fe5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:49:32,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-09 02:49:32,397 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-03-09 02:49:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 02:49:32,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:32,406 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-03-09 02:49:32,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:32,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:32,413 INFO L85 PathProgramCache]: Analyzing trace with hash 939221575, now seen corresponding path program 1 times [2025-03-09 02:49:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:32,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125266505] [2025-03-09 02:49:32,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:32,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:32,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 02:49:32,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 02:49:32,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:32,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:32,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:32,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125266505] [2025-03-09 02:49:32,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125266505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:32,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:32,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:49:32,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903322403] [2025-03-09 02:49:32,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:32,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:32,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:32,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:32,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:32,745 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-03-09 02:49:32,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:32,829 INFO L93 Difference]: Finished difference Result 532 states and 700 transitions. [2025-03-09 02:49:32,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:32,832 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-03-09 02:49:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:32,839 INFO L225 Difference]: With dead ends: 532 [2025-03-09 02:49:32,840 INFO L226 Difference]: Without dead ends: 256 [2025-03-09 02:49:32,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:32,846 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-03-09 02:49:32,848 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-03-09 02:49:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-09 02:49:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-09 02:49:32,888 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-03-09 02:49:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2025-03-09 02:49:32,894 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 21 [2025-03-09 02:49:32,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:32,895 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2025-03-09 02:49:32,895 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-03-09 02:49:32,895 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2025-03-09 02:49:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 02:49:32,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:32,897 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-03-09 02:49:32,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:49:32,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:32,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:32,899 INFO L85 PathProgramCache]: Analyzing trace with hash -88582510, now seen corresponding path program 1 times [2025-03-09 02:49:32,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:32,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245980355] [2025-03-09 02:49:32,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:32,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:32,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:49:33,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:49:33,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:33,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:49:33,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:33,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245980355] [2025-03-09 02:49:33,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245980355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:33,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:33,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:33,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091634601] [2025-03-09 02:49:33,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:33,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:33,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:33,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:33,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:33,155 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-03-09 02:49:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:33,245 INFO L93 Difference]: Finished difference Result 509 states and 649 transitions. [2025-03-09 02:49:33,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:33,246 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-03-09 02:49:33,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:33,252 INFO L225 Difference]: With dead ends: 509 [2025-03-09 02:49:33,252 INFO L226 Difference]: Without dead ends: 503 [2025-03-09 02:49:33,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:33,253 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 268 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:33,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 632 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:49:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-09 02:49:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 493. [2025-03-09 02:49:33,284 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-03-09 02:49:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 643 transitions. [2025-03-09 02:49:33,291 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 643 transitions. Word has length 45 [2025-03-09 02:49:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:33,292 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 643 transitions. [2025-03-09 02:49:33,292 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-03-09 02:49:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 643 transitions. [2025-03-09 02:49:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 02:49:33,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:33,297 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-03-09 02:49:33,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:49:33,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:33,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash -914583673, now seen corresponding path program 1 times [2025-03-09 02:49:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:33,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454899783] [2025-03-09 02:49:33,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:33,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:33,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:49:33,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:49:33,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:33,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:49:33,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:33,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454899783] [2025-03-09 02:49:33,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454899783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:33,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354658454] [2025-03-09 02:49:33,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:33,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:33,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:33,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:33,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:49:33,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:49:33,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:49:33,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:33,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:33,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 02:49:33,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:49:33,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:33,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354658454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:33,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:33,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-09 02:49:33,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497941689] [2025-03-09 02:49:33,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:33,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:33,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:33,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:33,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:49:33,815 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-03-09 02:49:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:33,863 INFO L93 Difference]: Finished difference Result 1168 states and 1518 transitions. [2025-03-09 02:49:33,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:33,867 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-03-09 02:49:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:33,874 INFO L225 Difference]: With dead ends: 1168 [2025-03-09 02:49:33,874 INFO L226 Difference]: Without dead ends: 678 [2025-03-09 02:49:33,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:49:33,877 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-03-09 02:49:33,877 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-03-09 02:49:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-03-09 02:49:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 666. [2025-03-09 02:49:33,921 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-03-09 02:49:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 870 transitions. [2025-03-09 02:49:33,925 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 870 transitions. Word has length 66 [2025-03-09 02:49:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:33,925 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 870 transitions. [2025-03-09 02:49:33,925 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-03-09 02:49:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 870 transitions. [2025-03-09 02:49:33,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 02:49:33,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:33,929 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-03-09 02:49:33,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:49:34,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:34,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:34,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1057108131, now seen corresponding path program 1 times [2025-03-09 02:49:34,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:34,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129067412] [2025-03-09 02:49:34,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:34,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:34,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:49:34,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:49:34,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:34,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 02:49:34,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:34,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129067412] [2025-03-09 02:49:34,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129067412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:34,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:34,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:49:34,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790870495] [2025-03-09 02:49:34,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:34,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:34,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:34,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:34,313 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-03-09 02:49:35,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:49:35,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:35,487 INFO L93 Difference]: Finished difference Result 1208 states and 1565 transitions. [2025-03-09 02:49:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:35,490 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-03-09 02:49:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:35,494 INFO L225 Difference]: With dead ends: 1208 [2025-03-09 02:49:35,494 INFO L226 Difference]: Without dead ends: 751 [2025-03-09 02:49:35,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:35,496 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 99 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:35,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 632 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 02:49:35,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-09 02:49:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 749. [2025-03-09 02:49:35,529 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-03-09 02:49:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 968 transitions. [2025-03-09 02:49:35,534 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 968 transitions. Word has length 64 [2025-03-09 02:49:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:35,534 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 968 transitions. [2025-03-09 02:49:35,535 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-03-09 02:49:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 968 transitions. [2025-03-09 02:49:35,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-09 02:49:35,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:35,536 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-03-09 02:49:35,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:49:35,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:35,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1083516670, now seen corresponding path program 1 times [2025-03-09 02:49:35,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:35,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49233133] [2025-03-09 02:49:35,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:35,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:35,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 02:49:35,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 02:49:35,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:35,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 02:49:35,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:35,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49233133] [2025-03-09 02:49:35,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49233133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:35,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:35,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:35,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467200096] [2025-03-09 02:49:35,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:35,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:35,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:35,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:35,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:35,730 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-03-09 02:49:35,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:35,792 INFO L93 Difference]: Finished difference Result 1597 states and 2101 transitions. [2025-03-09 02:49:35,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:35,792 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-03-09 02:49:35,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:35,797 INFO L225 Difference]: With dead ends: 1597 [2025-03-09 02:49:35,797 INFO L226 Difference]: Without dead ends: 851 [2025-03-09 02:49:35,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:35,800 INFO L435 NwaCegarLoop]: 295 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, 577 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:35,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 577 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:35,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-09 02:49:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2025-03-09 02:49:35,867 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-03-09 02:49:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1118 transitions. [2025-03-09 02:49:35,872 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1118 transitions. Word has length 84 [2025-03-09 02:49:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:35,873 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1118 transitions. [2025-03-09 02:49:35,873 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-03-09 02:49:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1118 transitions. [2025-03-09 02:49:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:49:35,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:35,874 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-03-09 02:49:35,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:49:35,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:35,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:35,875 INFO L85 PathProgramCache]: Analyzing trace with hash -753372877, now seen corresponding path program 1 times [2025-03-09 02:49:35,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:35,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34343826] [2025-03-09 02:49:35,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:35,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:35,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 02:49:35,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:49:35,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:35,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 02:49:35,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:35,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34343826] [2025-03-09 02:49:35,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34343826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:35,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:35,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:35,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822140030] [2025-03-09 02:49:35,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:35,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:35,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:35,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:35,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:35,992 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-03-09 02:49:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:36,033 INFO L93 Difference]: Finished difference Result 1467 states and 1928 transitions. [2025-03-09 02:49:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:36,034 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-03-09 02:49:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:36,040 INFO L225 Difference]: With dead ends: 1467 [2025-03-09 02:49:36,040 INFO L226 Difference]: Without dead ends: 859 [2025-03-09 02:49:36,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:36,042 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-03-09 02:49:36,042 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-03-09 02:49:36,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-03-09 02:49:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2025-03-09 02:49:36,073 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-03-09 02:49:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1128 transitions. [2025-03-09 02:49:36,078 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1128 transitions. Word has length 86 [2025-03-09 02:49:36,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:36,079 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1128 transitions. [2025-03-09 02:49:36,079 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-03-09 02:49:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1128 transitions. [2025-03-09 02:49:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-09 02:49:36,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:36,082 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-03-09 02:49:36,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:49:36,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:36,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:36,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1593591337, now seen corresponding path program 1 times [2025-03-09 02:49:36,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:36,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781707276] [2025-03-09 02:49:36,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:36,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:36,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-09 02:49:36,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-09 02:49:36,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:36,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 02:49:36,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:36,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781707276] [2025-03-09 02:49:36,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781707276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:36,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671591271] [2025-03-09 02:49:36,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:36,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:36,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:36,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:36,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:49:36,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-09 02:49:36,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-09 02:49:36,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:36,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:36,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:36,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 02:49:36,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:36,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671591271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:36,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:36,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:49:36,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409411598] [2025-03-09 02:49:36,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:36,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:36,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:36,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:36,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:36,586 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-03-09 02:49:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:36,664 INFO L93 Difference]: Finished difference Result 1715 states and 2262 transitions. [2025-03-09 02:49:36,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:36,665 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-03-09 02:49:36,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:36,670 INFO L225 Difference]: With dead ends: 1715 [2025-03-09 02:49:36,670 INFO L226 Difference]: Without dead ends: 859 [2025-03-09 02:49:36,672 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-03-09 02:49:36,674 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 62 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:36,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 610 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-03-09 02:49:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2025-03-09 02:49:36,701 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-03-09 02:49:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1122 transitions. [2025-03-09 02:49:36,707 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1122 transitions. Word has length 89 [2025-03-09 02:49:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:36,708 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1122 transitions. [2025-03-09 02:49:36,708 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-03-09 02:49:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1122 transitions. [2025-03-09 02:49:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 02:49:36,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:36,712 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-03-09 02:49:36,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:36,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-09 02:49:36,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:36,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:36,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2138276090, now seen corresponding path program 1 times [2025-03-09 02:49:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:36,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826035387] [2025-03-09 02:49:36,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:36,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:36,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 02:49:36,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 02:49:36,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:36,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 02:49:37,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:37,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826035387] [2025-03-09 02:49:37,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826035387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:37,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394275043] [2025-03-09 02:49:37,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:37,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:37,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:37,075 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:37,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:49:37,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 02:49:37,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 02:49:37,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:37,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:37,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:37,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 02:49:37,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:49:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 02:49:37,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394275043] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:49:37,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:49:37,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:49:37,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151036410] [2025-03-09 02:49:37,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:49:37,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:49:37,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:37,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:49:37,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:37,424 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-03-09 02:49:37,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:37,535 INFO L93 Difference]: Finished difference Result 979 states and 1311 transitions. [2025-03-09 02:49:37,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:49:37,535 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-03-09 02:49:37,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:37,541 INFO L225 Difference]: With dead ends: 979 [2025-03-09 02:49:37,541 INFO L226 Difference]: Without dead ends: 976 [2025-03-09 02:49:37,542 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-03-09 02:49:37,542 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 152 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:37,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1079 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:49:37,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-09 02:49:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2025-03-09 02:49:37,580 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-03-09 02:49:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1098 transitions. [2025-03-09 02:49:37,585 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1098 transitions. Word has length 90 [2025-03-09 02:49:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:37,585 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1098 transitions. [2025-03-09 02:49:37,585 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-03-09 02:49:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1098 transitions. [2025-03-09 02:49:37,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 02:49:37,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:37,587 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-03-09 02:49:37,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:37,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:37,787 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:37,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:37,788 INFO L85 PathProgramCache]: Analyzing trace with hash 789631214, now seen corresponding path program 2 times [2025-03-09 02:49:37,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:37,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006667216] [2025-03-09 02:49:37,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:49:37,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:37,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-09 02:49:37,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 88 statements. [2025-03-09 02:49:37,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:49:37,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 02:49:37,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:37,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006667216] [2025-03-09 02:49:37,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006667216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:37,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:37,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:49:37,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817326508] [2025-03-09 02:49:37,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:37,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:49:37,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:37,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:49:37,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:37,878 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-03-09 02:49:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:38,593 INFO L93 Difference]: Finished difference Result 2303 states and 2989 transitions. [2025-03-09 02:49:38,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:49:38,595 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-03-09 02:49:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:38,604 INFO L225 Difference]: With dead ends: 2303 [2025-03-09 02:49:38,604 INFO L226 Difference]: Without dead ends: 1697 [2025-03-09 02:49:38,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:38,609 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 288 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:38,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1978 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:49:38,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-03-09 02:49:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 856. [2025-03-09 02:49:38,653 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-03-09 02:49:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1110 transitions. [2025-03-09 02:49:38,659 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1110 transitions. Word has length 88 [2025-03-09 02:49:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:38,659 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1110 transitions. [2025-03-09 02:49:38,660 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-03-09 02:49:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1110 transitions. [2025-03-09 02:49:38,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 02:49:38,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:38,662 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-03-09 02:49:38,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:49:38,663 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:38,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:38,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2013990738, now seen corresponding path program 1 times [2025-03-09 02:49:38,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:38,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808659178] [2025-03-09 02:49:38,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:38,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:38,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 02:49:38,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 02:49:38,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:38,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 02:49:38,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:38,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808659178] [2025-03-09 02:49:38,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808659178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:38,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:38,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:38,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320992535] [2025-03-09 02:49:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:38,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:38,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:38,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:38,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:38,922 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-03-09 02:49:38,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:38,984 INFO L93 Difference]: Finished difference Result 1703 states and 2226 transitions. [2025-03-09 02:49:38,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:38,985 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-03-09 02:49:38,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:38,996 INFO L225 Difference]: With dead ends: 1703 [2025-03-09 02:49:38,996 INFO L226 Difference]: Without dead ends: 1701 [2025-03-09 02:49:38,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:38,998 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-03-09 02:49:38,999 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-03-09 02:49:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2025-03-09 02:49:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1693. [2025-03-09 02:49:39,109 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-03-09 02:49:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2220 transitions. [2025-03-09 02:49:39,120 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2220 transitions. Word has length 96 [2025-03-09 02:49:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:39,121 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2220 transitions. [2025-03-09 02:49:39,121 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-03-09 02:49:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2220 transitions. [2025-03-09 02:49:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 02:49:39,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:39,123 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-03-09 02:49:39,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:49:39,124 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:39,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:39,124 INFO L85 PathProgramCache]: Analyzing trace with hash 235100857, now seen corresponding path program 1 times [2025-03-09 02:49:39,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:39,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243842586] [2025-03-09 02:49:39,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:39,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 02:49:39,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 02:49:39,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:39,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-09 02:49:39,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:39,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243842586] [2025-03-09 02:49:39,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243842586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:39,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59107056] [2025-03-09 02:49:39,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:39,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:39,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:39,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:39,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:49:39,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 02:49:39,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 02:49:39,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:39,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:39,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:49:39,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:39,584 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:49:39,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:39,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59107056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:39,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:39,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-09 02:49:39,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583057052] [2025-03-09 02:49:39,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:39,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:49:39,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:39,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:49:39,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:39,585 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-03-09 02:49:41,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:49:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:41,356 INFO L93 Difference]: Finished difference Result 4617 states and 6041 transitions. [2025-03-09 02:49:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:49:41,357 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-03-09 02:49:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:41,373 INFO L225 Difference]: With dead ends: 4617 [2025-03-09 02:49:41,373 INFO L226 Difference]: Without dead ends: 3403 [2025-03-09 02:49:41,378 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-03-09 02:49:41,378 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 288 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:41,379 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.6s Time] [2025-03-09 02:49:41,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2025-03-09 02:49:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 1693. [2025-03-09 02:49:41,470 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-03-09 02:49:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2220 transitions. [2025-03-09 02:49:41,476 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2220 transitions. Word has length 105 [2025-03-09 02:49:41,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:41,476 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2220 transitions. [2025-03-09 02:49:41,476 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-03-09 02:49:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2220 transitions. [2025-03-09 02:49:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-09 02:49:41,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:41,478 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-03-09 02:49:41,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:49:41,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:41,679 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:41,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:41,679 INFO L85 PathProgramCache]: Analyzing trace with hash -99165389, now seen corresponding path program 1 times [2025-03-09 02:49:41,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:41,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892820488] [2025-03-09 02:49:41,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:41,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:41,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-09 02:49:41,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-09 02:49:41,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:41,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 02:49:42,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:42,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892820488] [2025-03-09 02:49:42,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892820488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:42,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313913594] [2025-03-09 02:49:42,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:42,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:42,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:42,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:42,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:49:42,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-09 02:49:42,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-09 02:49:42,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:42,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:42,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:49:42,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 02:49:42,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:42,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313913594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:42,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:42,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 11 [2025-03-09 02:49:42,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110356355] [2025-03-09 02:49:42,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:42,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:49:42,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:42,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:49:42,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:49:42,702 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-03-09 02:49:46,707 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-03-09 02:49:50,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:49:51,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:51,144 INFO L93 Difference]: Finished difference Result 1713 states and 2229 transitions. [2025-03-09 02:49:51,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:49:51,145 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-03-09 02:49:51,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:51,149 INFO L225 Difference]: With dead ends: 1713 [2025-03-09 02:49:51,149 INFO L226 Difference]: Without dead ends: 842 [2025-03-09 02:49:51,151 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-03-09 02:49:51,152 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 328 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 155 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:51,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 427 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2025-03-09 02:49:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-09 02:49:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2025-03-09 02:49:51,188 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-03-09 02:49:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1089 transitions. [2025-03-09 02:49:51,192 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1089 transitions. Word has length 115 [2025-03-09 02:49:51,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:51,192 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1089 transitions. [2025-03-09 02:49:51,193 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-03-09 02:49:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1089 transitions. [2025-03-09 02:49:51,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-09 02:49:51,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:51,194 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-03-09 02:49:51,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:51,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 02:49:51,395 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:51,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:51,396 INFO L85 PathProgramCache]: Analyzing trace with hash -153893353, now seen corresponding path program 1 times [2025-03-09 02:49:51,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:51,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491251988] [2025-03-09 02:49:51,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:51,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:51,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-09 02:49:51,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-09 02:49:51,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:51,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:49:51,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:51,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491251988] [2025-03-09 02:49:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491251988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:51,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:51,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:49:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749552814] [2025-03-09 02:49:51,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:51,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:51,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:51,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:49:51,551 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-03-09 02:49:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:51,596 INFO L93 Difference]: Finished difference Result 1681 states and 2178 transitions. [2025-03-09 02:49:51,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:51,597 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-03-09 02:49:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:51,602 INFO L225 Difference]: With dead ends: 1681 [2025-03-09 02:49:51,602 INFO L226 Difference]: Without dead ends: 842 [2025-03-09 02:49:51,604 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-03-09 02:49:51,605 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-03-09 02:49:51,606 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-03-09 02:49:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-09 02:49:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2025-03-09 02:49:51,639 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-03-09 02:49:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1086 transitions. [2025-03-09 02:49:51,643 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1086 transitions. Word has length 130 [2025-03-09 02:49:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:51,644 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1086 transitions. [2025-03-09 02:49:51,644 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-03-09 02:49:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1086 transitions. [2025-03-09 02:49:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-09 02:49:51,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:51,646 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-03-09 02:49:51,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 02:49:51,646 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:51,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1509590158, now seen corresponding path program 1 times [2025-03-09 02:49:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:51,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906164260] [2025-03-09 02:49:51,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:51,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-09 02:49:51,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-09 02:49:51,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:51,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-09 02:49:51,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:51,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906164260] [2025-03-09 02:49:51,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906164260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:51,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214702898] [2025-03-09 02:49:51,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:51,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:51,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:51,812 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:51,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:49:52,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-09 02:49:52,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-09 02:49:52,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:52,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:52,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:52,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-09 02:49:52,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:52,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214702898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:52,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:52,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:49:52,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078370034] [2025-03-09 02:49:52,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:52,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:52,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:52,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:52,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:52,186 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-03-09 02:49:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:52,238 INFO L93 Difference]: Finished difference Result 842 states and 1086 transitions. [2025-03-09 02:49:52,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:52,238 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-03-09 02:49:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:52,243 INFO L225 Difference]: With dead ends: 842 [2025-03-09 02:49:52,243 INFO L226 Difference]: Without dead ends: 841 [2025-03-09 02:49:52,243 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-03-09 02:49:52,244 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-03-09 02:49:52,244 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-03-09 02:49:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-03-09 02:49:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2025-03-09 02:49:52,300 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-03-09 02:49:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1084 transitions. [2025-03-09 02:49:52,304 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1084 transitions. Word has length 134 [2025-03-09 02:49:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:52,305 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1084 transitions. [2025-03-09 02:49:52,305 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-03-09 02:49:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1084 transitions. [2025-03-09 02:49:52,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-09 02:49:52,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:52,307 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-03-09 02:49:52,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:52,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:52,512 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:52,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:52,513 INFO L85 PathProgramCache]: Analyzing trace with hash 447345540, now seen corresponding path program 1 times [2025-03-09 02:49:52,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:52,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818700635] [2025-03-09 02:49:52,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:52,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:52,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-09 02:49:52,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-09 02:49:52,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:52,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-09 02:49:52,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:52,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818700635] [2025-03-09 02:49:52,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818700635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:52,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393327608] [2025-03-09 02:49:52,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:52,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:52,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:52,688 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:52,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:49:53,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-09 02:49:53,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-09 02:49:53,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:53,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:53,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:53,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-09 02:49:53,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:49:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-09 02:49:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393327608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:49:53,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:49:53,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:49:53,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226552575] [2025-03-09 02:49:53,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:49:53,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:49:53,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:53,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:49:53,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:53,335 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-03-09 02:49:53,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:53,435 INFO L93 Difference]: Finished difference Result 851 states and 1102 transitions. [2025-03-09 02:49:53,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:49:53,436 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-03-09 02:49:53,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:53,442 INFO L225 Difference]: With dead ends: 851 [2025-03-09 02:49:53,442 INFO L226 Difference]: Without dead ends: 850 [2025-03-09 02:49:53,443 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-03-09 02:49:53,445 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:53,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1119 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-09 02:49:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 834. [2025-03-09 02:49:53,544 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-03-09 02:49:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1074 transitions. [2025-03-09 02:49:53,551 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1074 transitions. Word has length 135 [2025-03-09 02:49:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:53,551 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1074 transitions. [2025-03-09 02:49:53,552 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-03-09 02:49:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1074 transitions. [2025-03-09 02:49:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-09 02:49:53,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:53,556 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-03-09 02:49:53,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:53,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:53,757 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:53,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:53,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1941926397, now seen corresponding path program 1 times [2025-03-09 02:49:53,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:53,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216837438] [2025-03-09 02:49:53,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:53,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:53,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-09 02:49:53,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-09 02:49:53,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:53,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:49:53,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216837438] [2025-03-09 02:49:53,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216837438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425299274] [2025-03-09 02:49:53,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:53,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:53,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:53,937 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:53,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:49:54,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-09 02:49:54,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-09 02:49:54,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:54,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:54,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:54,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 02:49:54,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:54,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425299274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:54,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:54,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:49:54,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644331085] [2025-03-09 02:49:54,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:54,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:54,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:54,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:54,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:54,434 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-03-09 02:49:58,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:49:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:58,252 INFO L93 Difference]: Finished difference Result 836 states and 1078 transitions. [2025-03-09 02:49:58,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:58,253 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-03-09 02:49:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:58,257 INFO L225 Difference]: With dead ends: 836 [2025-03-09 02:49:58,258 INFO L226 Difference]: Without dead ends: 833 [2025-03-09 02:49:58,258 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-03-09 02:49:58,259 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 396 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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, 3.8s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:58,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 652 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-09 02:49:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-09 02:49:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 831. [2025-03-09 02:49:58,297 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-03-09 02:49:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1071 transitions. [2025-03-09 02:49:58,301 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1071 transitions. Word has length 136 [2025-03-09 02:49:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:58,301 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1071 transitions. [2025-03-09 02:49:58,301 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-03-09 02:49:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1071 transitions. [2025-03-09 02:49:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-09 02:49:58,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:58,304 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-03-09 02:49:58,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:58,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 02:49:58,508 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:49:58,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:58,508 INFO L85 PathProgramCache]: Analyzing trace with hash 70176423, now seen corresponding path program 1 times [2025-03-09 02:49:58,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:58,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963507801] [2025-03-09 02:49:58,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:58,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-09 02:49:58,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-09 02:49:58,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:58,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:49:58,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:58,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963507801] [2025-03-09 02:49:58,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963507801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:58,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816378424] [2025-03-09 02:49:58,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:58,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:58,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:58,679 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:58,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:49:58,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-09 02:49:59,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-09 02:49:59,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:59,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:59,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:59,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 02:49:59,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:49:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:49:59,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816378424] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:49:59,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:49:59,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:49:59,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810165399] [2025-03-09 02:49:59,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:49:59,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:49:59,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:59,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:49:59,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:59,358 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-03-09 02:49:59,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:59,848 INFO L93 Difference]: Finished difference Result 1422 states and 1833 transitions. [2025-03-09 02:49:59,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:49:59,848 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-03-09 02:49:59,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:59,854 INFO L225 Difference]: With dead ends: 1422 [2025-03-09 02:49:59,855 INFO L226 Difference]: Without dead ends: 1419 [2025-03-09 02:49:59,856 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-03-09 02:49:59,856 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 844 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:59,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 892 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:49:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2025-03-09 02:49:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1182. [2025-03-09 02:49:59,907 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-03-09 02:49:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1518 transitions. [2025-03-09 02:49:59,912 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1518 transitions. Word has length 137 [2025-03-09 02:49:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:59,912 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1518 transitions. [2025-03-09 02:49:59,913 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-03-09 02:49:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1518 transitions. [2025-03-09 02:49:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-09 02:49:59,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:59,916 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-03-09 02:49:59,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 02:50:00,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 02:50:00,118 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:50:00,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:50:00,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1554422875, now seen corresponding path program 1 times [2025-03-09 02:50:00,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:50:00,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790075962] [2025-03-09 02:50:00,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:50:00,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:50:00,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-09 02:50:00,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-09 02:50:00,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:50:00,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:50:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-09 02:50:00,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:50:00,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790075962] [2025-03-09 02:50:00,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790075962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:50:00,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:50:00,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:50:00,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444114331] [2025-03-09 02:50:00,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:50:00,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:50:00,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:50:00,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:50:00,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:50:00,311 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-03-09 02:50:02,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:50:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:50:02,214 INFO L93 Difference]: Finished difference Result 1513 states and 1940 transitions. [2025-03-09 02:50:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:50:02,215 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-03-09 02:50:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:50:02,216 INFO L225 Difference]: With dead ends: 1513 [2025-03-09 02:50:02,216 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:50:02,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:50:02,219 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 242 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-09 02:50:02,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 305 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-09 02:50:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:50:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:50:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:50:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:50:02,220 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 231 [2025-03-09 02:50:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:50:02,221 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:50:02,221 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-03-09 02:50:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:50:02,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:50:02,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-03-09 02:50:02,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-09 02:50:02,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-09 02:50:02,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-03-09 02:50:02,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-09 02:50:02,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-09 02:50:02,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-09 02:50:02,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-09 02:50:02,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-09 02:50:02,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-09 02:50:02,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-09 02:50:02,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-09 02:50:02,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-09 02:50:02,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-09 02:50:02,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-09 02:50:02,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-09 02:50:02,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:50:02,228 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:50:02,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:50:07,560 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:50:07,570 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-09 02:50:07,571 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-09 02:50:07,571 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-09 02:50:07,573 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-09 02:50:07,573 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-09 02:50:07,573 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-09 02:50:07,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:50:07 BoogieIcfgContainer [2025-03-09 02:50:07,574 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:50:07,574 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:50:07,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:50:07,575 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:50:07,575 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:49:32" (3/4) ... [2025-03-09 02:50:07,577 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:50:07,586 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2025-03-09 02:50:07,586 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_probe [2025-03-09 02:50:07,586 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2025-03-09 02:50:07,586 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2025-03-09 02:50:07,586 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-09 02:50:07,586 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove [2025-03-09 02:50:07,587 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2025-03-09 02:50:07,587 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2025-03-09 02:50:07,587 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2025-03-09 02:50:07,587 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure dev_err [2025-03-09 02:50:07,587 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-09 02:50:07,587 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2025-03-09 02:50:07,587 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2025-03-09 02:50:07,587 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2025-03-09 02:50:07,587 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2025-03-09 02:50:07,587 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2025-03-09 02:50:07,587 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file [2025-03-09 02:50:07,587 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2025-03-09 02:50:07,597 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2025-03-09 02:50:07,598 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-09 02:50:07,599 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-09 02:50:07,600 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 02:50:07,600 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:50:07,634 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-03-09 02:50:07,635 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-03-09 02:50:07,683 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-03-09 02:50:07,683 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-03-09 02:50:07,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:50:07,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:50:07,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:50:07,731 INFO L158 Benchmark]: Toolchain (without parser) took 38062.50ms. Allocated memory was 201.3MB in the beginning and 528.5MB in the end (delta: 327.2MB). Free memory was 156.5MB in the beginning and 269.0MB in the end (delta: -112.5MB). Peak memory consumption was 215.4MB. Max. memory is 16.1GB. [2025-03-09 02:50:07,731 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:50:07,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.00ms. Allocated memory is still 201.3MB. Free memory was 156.5MB in the beginning and 126.2MB in the end (delta: 30.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 02:50:07,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.81ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 122.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:50:07,731 INFO L158 Benchmark]: Boogie Preprocessor took 106.58ms. Allocated memory is still 201.3MB. Free memory was 122.0MB in the beginning and 114.2MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:50:07,732 INFO L158 Benchmark]: IcfgBuilder took 1967.78ms. Allocated memory is still 201.3MB. Free memory was 114.2MB in the beginning and 59.1MB in the end (delta: 55.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-09 02:50:07,732 INFO L158 Benchmark]: TraceAbstraction took 35283.32ms. Allocated memory was 201.3MB in the beginning and 528.5MB in the end (delta: 327.2MB). Free memory was 58.6MB in the beginning and 285.5MB in the end (delta: -226.9MB). Peak memory consumption was 160.7MB. Max. memory is 16.1GB. [2025-03-09 02:50:07,732 INFO L158 Benchmark]: Witness Printer took 155.74ms. Allocated memory is still 528.5MB. Free memory was 285.5MB in the beginning and 269.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:50:07,733 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.25ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.00ms. Allocated memory is still 201.3MB. Free memory was 156.5MB in the beginning and 126.2MB in the end (delta: 30.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.81ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 122.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 106.58ms. Allocated memory is still 201.3MB. Free memory was 122.0MB in the beginning and 114.2MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1967.78ms. Allocated memory is still 201.3MB. Free memory was 114.2MB in the beginning and 59.1MB in the end (delta: 55.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 35283.32ms. Allocated memory was 201.3MB in the beginning and 528.5MB in the end (delta: 327.2MB). Free memory was 58.6MB in the beginning and 285.5MB in the end (delta: -226.9MB). Peak memory consumption was 160.7MB. Max. memory is 16.1GB. * Witness Printer took 155.74ms. Allocated memory is still 528.5MB. Free memory was 285.5MB in the beginning and 269.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 256 locations, 378 edges, 16 error locations. Started 1 CEGAR loops. OverallTime: 29.9s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 3538 SdHoareTripleChecker+Valid, 18.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3489 mSDsluCounter, 15038 SdHoareTripleChecker+Invalid, 17.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8919 mSDsCounter, 228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1100 IncrementalHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 228 mSolverCounterUnsat, 6119 mSDtfsCounter, 1100 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1425 GetRequests, 1364 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s 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.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 2970 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2859 NumberOfCodeBlocks, 2792 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3191 ConstructedInterpolants, 0 QuantifiedInterpolants, 5368 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: 1002]: Location Invariant Derived location 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: 1015]: Location Invariant Derived location 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-03-09 02:50:07,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE