./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /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 --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /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 -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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.2.5-dev-84cfde4 [2024-10-11 21:21:49,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:21:49,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 21:21:49,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:21:49,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:21:49,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:21:49,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:21:49,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:21:49,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:21:49,099 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:21:49,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:21:49,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:21:49,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:21:49,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:21:49,100 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:21:49,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:21:49,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:21:49,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:21:49,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:21:49,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:21:49,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:21:49,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:21:49,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:21:49,105 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:21:49,105 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:21:49,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:21:49,106 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:21:49,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:21:49,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:21:49,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:21:49,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:21:49,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:21:49,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:21:49,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:21:49,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:21:49,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:21:49,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:21:49,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:21:49,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:21:49,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:21:49,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:21:49,109 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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 [2024-10-11 21:21:49,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:21:49,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:21:49,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:21:49,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:21:49,335 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:21:49,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /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 [2024-10-11 21:21:50,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:21:50,711 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:21:50,712 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 [2024-10-11 21:21:50,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e36be066c/0795cab8bac84d15831e11c341051c68/FLAG6d370974a [2024-10-11 21:21:51,049 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e36be066c/0795cab8bac84d15831e11c341051c68 [2024-10-11 21:21:51,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:21:51,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:21:51,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:21:51,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:21:51,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:21:51,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d74a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51, skipping insertion in model container [2024-10-11 21:21:51,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:21:51,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:21:51,498 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:21:51,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:21:51,609 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:21:51,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51 WrapperNode [2024-10-11 21:21:51,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:21:51,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:21:51,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:21:51,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:21:51,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,664 INFO L138 Inliner]: procedures = 83, calls = 179, calls flagged for inlining = 34, calls inlined = 27, statements flattened = 583 [2024-10-11 21:21:51,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:21:51,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:21:51,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:21:51,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:21:51,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,721 INFO L175 MemorySlicer]: Split 53 memory accesses to 4 slices as follows [2, 4, 27, 20]. 51 percent of accesses are in the largest equivalence class. The 26 initializations are split as follows [2, 4, 0, 20]. The 13 writes are split as follows [0, 0, 13, 0]. [2024-10-11 21:21:51,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:21:51,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:21:51,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:21:51,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:21:51,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51" (1/1) ... [2024-10-11 21:21:51,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:21:51,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:51,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:21:51,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:21:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2024-10-11 21:21:51,839 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2024-10-11 21:21:51,839 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_probe [2024-10-11 21:21:51,839 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_probe [2024-10-11 21:21:51,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:21:51,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-11 21:21:51,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-11 21:21:51,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 21:21:51,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 21:21:51,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 21:21:51,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 21:21:51,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 21:21:51,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-11 21:21:51,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-11 21:21:51,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 21:21:51,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 21:21:51,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 21:21:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 21:21:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-11 21:21:51,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-11 21:21:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 21:21:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 21:21:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 21:21:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 21:21:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2024-10-11 21:21:51,841 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2024-10-11 21:21:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-11 21:21:51,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-11 21:21:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 21:21:51,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 21:21:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2024-10-11 21:21:51,842 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2024-10-11 21:21:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 21:21:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 21:21:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 21:21:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 21:21:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 21:21:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2024-10-11 21:21:51,843 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2024-10-11 21:21:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2024-10-11 21:21:51,843 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2024-10-11 21:21:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-11 21:21:51,844 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-11 21:21:51,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 21:21:51,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 21:21:51,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 21:21:51,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 21:21:51,844 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2024-10-11 21:21:51,844 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2024-10-11 21:21:51,844 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 21:21:51,844 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 21:21:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:21:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 21:21:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 21:21:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 21:21:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove [2024-10-11 21:21:51,845 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove [2024-10-11 21:21:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 21:21:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2024-10-11 21:21:51,845 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2024-10-11 21:21:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:21:51,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:21:51,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2024-10-11 21:21:51,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2024-10-11 21:21:51,846 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-10-11 21:21:51,846 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-10-11 21:21:52,001 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:21:52,002 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:21:52,288 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-11 21:21:52,529 INFO L? ?]: Removed 255 outVars from TransFormulas that were not future-live. [2024-10-11 21:21:52,530 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:21:52,607 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:21:52,608 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 21:21:52,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:21:52 BoogieIcfgContainer [2024-10-11 21:21:52,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:21:52,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:21:52,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:21:52,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:21:52,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:21:51" (1/3) ... [2024-10-11 21:21:52,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741dd9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:21:52, skipping insertion in model container [2024-10-11 21:21:52,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:51" (2/3) ... [2024-10-11 21:21:52,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741dd9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:21:52, skipping insertion in model container [2024-10-11 21:21:52,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:21:52" (3/3) ... [2024-10-11 21:21:52,616 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2024-10-11 21:21:52,628 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:21:52,628 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-11 21:21:52,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:21:52,686 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;@7d80564, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:21:52,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 21:21:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 134 states have (on average 1.455223880597015) internal successors, (195), 157 states have internal predecessors, (195), 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) [2024-10-11 21:21:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 21:21:52,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:52,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:52,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:21:52,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:52,704 INFO L85 PathProgramCache]: Analyzing trace with hash -382779330, now seen corresponding path program 1 times [2024-10-11 21:21:52,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:52,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780340745] [2024-10-11 21:21:52,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:52,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:21:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:21:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:21:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780340745] [2024-10-11 21:21:53,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780340745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:53,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:53,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:21:53,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017730478] [2024-10-11 21:21:53,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:53,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:53,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:53,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:53,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:53,032 INFO L87 Difference]: Start difference. First operand has 216 states, 134 states have (on average 1.455223880597015) internal successors, (195), 157 states have internal predecessors, (195), 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 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:21:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:53,590 INFO L93 Difference]: Finished difference Result 470 states and 648 transitions. [2024-10-11 21:21:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:53,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 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 18 [2024-10-11 21:21:53,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:53,603 INFO L225 Difference]: With dead ends: 470 [2024-10-11 21:21:53,603 INFO L226 Difference]: Without dead ends: 242 [2024-10-11 21:21:53,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:53,613 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 75 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:53,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 462 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:21:53,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-11 21:21:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2024-10-11 21:21:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 145 states have (on average 1.4068965517241379) internal successors, (204), 163 states have internal predecessors, (204), 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) [2024-10-11 21:21:53,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 292 transitions. [2024-10-11 21:21:53,674 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 292 transitions. Word has length 18 [2024-10-11 21:21:53,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:53,674 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 292 transitions. [2024-10-11 21:21:53,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:21:53,675 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 292 transitions. [2024-10-11 21:21:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 21:21:53,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:53,677 INFO L215 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] [2024-10-11 21:21:53,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:21:53,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:21:53,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:53,680 INFO L85 PathProgramCache]: Analyzing trace with hash 860633556, now seen corresponding path program 1 times [2024-10-11 21:21:53,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:53,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597089057] [2024-10-11 21:21:53,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:53,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:21:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:21:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 21:21:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:21:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:21:53,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:53,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597089057] [2024-10-11 21:21:53,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597089057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:53,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:53,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:21:53,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969602763] [2024-10-11 21:21:53,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:21:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:53,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:21:53,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:53,889 INFO L87 Difference]: Start difference. First operand 222 states and 292 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 21:21:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:54,524 INFO L93 Difference]: Finished difference Result 483 states and 643 transitions. [2024-10-11 21:21:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:21:54,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2024-10-11 21:21:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:54,528 INFO L225 Difference]: With dead ends: 483 [2024-10-11 21:21:54,532 INFO L226 Difference]: Without dead ends: 477 [2024-10-11 21:21:54,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:21:54,533 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 290 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:54,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 591 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 21:21:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-11 21:21:54,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 427. [2024-10-11 21:21:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 289 states have (on average 1.3875432525951557) internal successors, (401), 310 states have internal predecessors, (401), 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) [2024-10-11 21:21:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 577 transitions. [2024-10-11 21:21:54,576 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 577 transitions. Word has length 39 [2024-10-11 21:21:54,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:54,576 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 577 transitions. [2024-10-11 21:21:54,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 21:21:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 577 transitions. [2024-10-11 21:21:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 21:21:54,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:54,579 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:54,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:21:54,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:21:54,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2105444755, now seen corresponding path program 1 times [2024-10-11 21:21:54,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:54,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430188743] [2024-10-11 21:21:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:54,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:54,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:21:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:54,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:21:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:54,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 21:21:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:54,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:54,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:21:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:54,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 21:21:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:54,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:54,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:21:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 21:21:54,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:54,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430188743] [2024-10-11 21:21:54,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430188743] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:54,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199043938] [2024-10-11 21:21:54,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:54,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:54,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:54,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:54,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:21:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:54,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 21:21:54,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:21:54,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:54,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199043938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:54,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:54,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-10-11 21:21:54,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382007745] [2024-10-11 21:21:54,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:54,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:21:54,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:54,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:21:54,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:21:54,984 INFO L87 Difference]: Start difference. First operand 427 states and 577 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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) [2024-10-11 21:21:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:55,080 INFO L93 Difference]: Finished difference Result 1012 states and 1362 transitions. [2024-10-11 21:21:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:21:55,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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 57 [2024-10-11 21:21:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:55,083 INFO L225 Difference]: With dead ends: 1012 [2024-10-11 21:21:55,086 INFO L226 Difference]: Without dead ends: 586 [2024-10-11 21:21:55,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:21:55,088 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 197 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:55,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 492 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:21:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-10-11 21:21:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 574. [2024-10-11 21:21:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 395 states have (on average 1.3822784810126583) internal successors, (546), 419 states have internal predecessors, (546), 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) [2024-10-11 21:21:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 778 transitions. [2024-10-11 21:21:55,139 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 778 transitions. Word has length 57 [2024-10-11 21:21:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:55,140 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 778 transitions. [2024-10-11 21:21:55,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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) [2024-10-11 21:21:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 778 transitions. [2024-10-11 21:21:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 21:21:55,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:55,143 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:55,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 21:21:55,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:55,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:21:55,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1658438164, now seen corresponding path program 1 times [2024-10-11 21:21:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:55,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605622212] [2024-10-11 21:21:55,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:55,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:21:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:21:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 21:21:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:21:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:21:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:21:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 21:21:55,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:55,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605622212] [2024-10-11 21:21:55,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605622212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:55,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:55,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:21:55,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085514561] [2024-10-11 21:21:55,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:55,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:21:55,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:55,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:21:55,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:55,440 INFO L87 Difference]: Start difference. First operand 574 states and 778 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:21:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:55,942 INFO L93 Difference]: Finished difference Result 1090 states and 1467 transitions. [2024-10-11 21:21:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:21:55,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 3 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 57 [2024-10-11 21:21:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:55,946 INFO L225 Difference]: With dead ends: 1090 [2024-10-11 21:21:55,946 INFO L226 Difference]: Without dead ends: 694 [2024-10-11 21:21:55,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:55,948 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 154 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:55,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 640 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:21:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-10-11 21:21:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 646. [2024-10-11 21:21:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 444 states have (on average 1.3716216216216217) internal successors, (609), 468 states have internal predecessors, (609), 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) [2024-10-11 21:21:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 865 transitions. [2024-10-11 21:21:55,979 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 865 transitions. Word has length 57 [2024-10-11 21:21:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:55,981 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 865 transitions. [2024-10-11 21:21:55,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:21:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 865 transitions. [2024-10-11 21:21:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 21:21:55,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:55,983 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-11 21:21:55,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:21:55,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:21:55,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:55,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1457739890, now seen corresponding path program 1 times [2024-10-11 21:21:55,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:55,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944057149] [2024-10-11 21:21:55,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:21:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:21:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:21:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:21:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:21:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:21:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 21:21:56,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:56,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944057149] [2024-10-11 21:21:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944057149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:56,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:56,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:21:56,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365020079] [2024-10-11 21:21:56,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:56,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:56,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:56,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:56,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:56,095 INFO L87 Difference]: Start difference. First operand 646 states and 865 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:56,373 INFO L93 Difference]: Finished difference Result 1422 states and 1945 transitions. [2024-10-11 21:21:56,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:56,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2024-10-11 21:21:56,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:56,379 INFO L225 Difference]: With dead ends: 1422 [2024-10-11 21:21:56,379 INFO L226 Difference]: Without dead ends: 777 [2024-10-11 21:21:56,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:56,384 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 80 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:56,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 486 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-10-11 21:21:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 739. [2024-10-11 21:21:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 516 states have (on average 1.372093023255814) internal successors, (708), 540 states have internal predecessors, (708), 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) [2024-10-11 21:21:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1006 transitions. [2024-10-11 21:21:56,428 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1006 transitions. Word has length 67 [2024-10-11 21:21:56,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:56,429 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1006 transitions. [2024-10-11 21:21:56,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1006 transitions. [2024-10-11 21:21:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 21:21:56,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:56,430 INFO L215 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] [2024-10-11 21:21:56,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:21:56,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:21:56,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash -190436025, now seen corresponding path program 1 times [2024-10-11 21:21:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:56,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552022367] [2024-10-11 21:21:56,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:56,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:21:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:21:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:21:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:21:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:21:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:21:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 21:21:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:56,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552022367] [2024-10-11 21:21:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552022367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:56,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993577825] [2024-10-11 21:21:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:56,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:56,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:56,544 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:56,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:21:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:56,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:56,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 21:21:56,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:56,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993577825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:56,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:56,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-11 21:21:56,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604074039] [2024-10-11 21:21:56,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:56,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:56,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:56,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:56,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:56,734 INFO L87 Difference]: Start difference. First operand 739 states and 1006 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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) [2024-10-11 21:21:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:56,836 INFO L93 Difference]: Finished difference Result 1477 states and 2020 transitions. [2024-10-11 21:21:56,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:56,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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 71 [2024-10-11 21:21:56,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:56,840 INFO L225 Difference]: With dead ends: 1477 [2024-10-11 21:21:56,840 INFO L226 Difference]: Without dead ends: 739 [2024-10-11 21:21:56,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:56,842 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 59 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:56,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 490 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:21:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-10-11 21:21:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2024-10-11 21:21:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 519 states have (on average 1.3526011560693643) internal successors, (702), 540 states have internal predecessors, (702), 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) [2024-10-11 21:21:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1000 transitions. [2024-10-11 21:21:56,867 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1000 transitions. Word has length 71 [2024-10-11 21:21:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:56,867 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1000 transitions. [2024-10-11 21:21:56,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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) [2024-10-11 21:21:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1000 transitions. [2024-10-11 21:21:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 21:21:56,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:56,868 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:56,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 21:21:57,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:57,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:21:57,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1608549279, now seen corresponding path program 1 times [2024-10-11 21:21:57,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:57,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332307720] [2024-10-11 21:21:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:57,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:21:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:21:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:21:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:21:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:21:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:21:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 21:21:57,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:57,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332307720] [2024-10-11 21:21:57,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332307720] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:57,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427963584] [2024-10-11 21:21:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:57,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:57,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:57,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:57,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:21:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:57,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 21:21:57,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:21:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 21:21:57,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427963584] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:21:57,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:21:57,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2024-10-11 21:21:57,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903408793] [2024-10-11 21:21:57,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:21:57,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:21:57,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:57,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:21:57,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:21:57,409 INFO L87 Difference]: Start difference. First operand 739 states and 1000 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:57,768 INFO L93 Difference]: Finished difference Result 888 states and 1237 transitions. [2024-10-11 21:21:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:21:57,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 72 [2024-10-11 21:21:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:57,774 INFO L225 Difference]: With dead ends: 888 [2024-10-11 21:21:57,774 INFO L226 Difference]: Without dead ends: 885 [2024-10-11 21:21:57,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:21:57,775 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 213 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:57,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 645 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:21:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-11 21:21:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 724. [2024-10-11 21:21:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 510 states have (on average 1.3411764705882352) internal successors, (684), 528 states have internal predecessors, (684), 146 states have call successors, (146), 58 states have call predecessors, (146), 58 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2024-10-11 21:21:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 976 transitions. [2024-10-11 21:21:57,814 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 976 transitions. Word has length 72 [2024-10-11 21:21:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:57,815 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 976 transitions. [2024-10-11 21:21:57,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 976 transitions. [2024-10-11 21:21:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 21:21:57,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:57,817 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 21:21:57,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 21:21:58,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:58,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:21:58,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:58,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1303215661, now seen corresponding path program 1 times [2024-10-11 21:21:58,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:58,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349496506] [2024-10-11 21:21:58,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:58,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:21:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:21:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 21:21:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:21:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:21:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 21:21:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 21:21:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:21:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 21:21:58,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:58,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349496506] [2024-10-11 21:21:58,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349496506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:58,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:58,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:21:58,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202356614] [2024-10-11 21:21:58,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:58,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:21:58,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:58,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:21:58,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:58,117 INFO L87 Difference]: Start difference. First operand 724 states and 976 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 21:21:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:58,416 INFO L93 Difference]: Finished difference Result 1302 states and 1776 transitions. [2024-10-11 21:21:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:21:58,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 3 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 75 [2024-10-11 21:21:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:58,420 INFO L225 Difference]: With dead ends: 1302 [2024-10-11 21:21:58,420 INFO L226 Difference]: Without dead ends: 784 [2024-10-11 21:21:58,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:58,422 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 99 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:58,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 448 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:21:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-10-11 21:21:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 732. [2024-10-11 21:21:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 516 states have (on average 1.3372093023255813) internal successors, (690), 534 states have internal predecessors, (690), 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) [2024-10-11 21:21:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 986 transitions. [2024-10-11 21:21:58,445 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 986 transitions. Word has length 75 [2024-10-11 21:21:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:58,445 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 986 transitions. [2024-10-11 21:21:58,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 21:21:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 986 transitions. [2024-10-11 21:21:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 21:21:58,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:58,447 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-11 21:21:58,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 21:21:58,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:21:58,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1751774315, now seen corresponding path program 1 times [2024-10-11 21:21:58,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:58,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331978696] [2024-10-11 21:21:58,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:58,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:21:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:21:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:21:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:21:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:21:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:21:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 21:21:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 21:21:58,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:58,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331978696] [2024-10-11 21:21:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331978696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:58,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:58,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:21:58,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843211512] [2024-10-11 21:21:58,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:58,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:58,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:58,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:58,607 INFO L87 Difference]: Start difference. First operand 732 states and 986 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 21:21:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:58,948 INFO L93 Difference]: Finished difference Result 1549 states and 2114 transitions. [2024-10-11 21:21:58,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:58,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-10-11 21:21:58,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:58,954 INFO L225 Difference]: With dead ends: 1549 [2024-10-11 21:21:58,955 INFO L226 Difference]: Without dead ends: 1547 [2024-10-11 21:21:58,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:58,956 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 278 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:58,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 554 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:21:58,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-11 21:21:58,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1447. [2024-10-11 21:21:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1025 states have (on average 1.333658536585366) internal successors, (1367), 1052 states have internal predecessors, (1367), 296 states have call successors, (296), 116 states have call predecessors, (296), 116 states have return successors, (311), 296 states have call predecessors, (311), 296 states have call successors, (311) [2024-10-11 21:21:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1974 transitions. [2024-10-11 21:21:59,006 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1974 transitions. Word has length 78 [2024-10-11 21:21:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:59,006 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1974 transitions. [2024-10-11 21:21:59,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 21:21:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1974 transitions. [2024-10-11 21:21:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 21:21:59,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:59,007 INFO L215 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, 1, 1, 1, 1] [2024-10-11 21:21:59,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 21:21:59,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:21:59,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash 515267006, now seen corresponding path program 2 times [2024-10-11 21:21:59,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:59,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388341307] [2024-10-11 21:21:59,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:59,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:21:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:21:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 21:21:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:21:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:21:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:21:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 21:21:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:21:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 21:21:59,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:59,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388341307] [2024-10-11 21:21:59,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388341307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:59,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:59,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:21:59,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440006181] [2024-10-11 21:21:59,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:59,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:21:59,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:59,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:21:59,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:59,100 INFO L87 Difference]: Start difference. First operand 1447 states and 1974 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 21:21:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:59,384 INFO L93 Difference]: Finished difference Result 2470 states and 3359 transitions. [2024-10-11 21:21:59,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:59,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 78 [2024-10-11 21:21:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:59,389 INFO L225 Difference]: With dead ends: 2470 [2024-10-11 21:21:59,389 INFO L226 Difference]: Without dead ends: 972 [2024-10-11 21:21:59,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:21:59,392 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 287 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:59,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 328 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2024-10-11 21:21:59,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 922. [2024-10-11 21:21:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 640 states have (on average 1.2921875) internal successors, (827), 661 states have internal predecessors, (827), 190 states have call successors, (190), 82 states have call predecessors, (190), 84 states have return successors, (208), 190 states have call predecessors, (208), 190 states have call successors, (208) [2024-10-11 21:21:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1225 transitions. [2024-10-11 21:21:59,426 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1225 transitions. Word has length 78 [2024-10-11 21:21:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:59,427 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1225 transitions. [2024-10-11 21:21:59,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 21:21:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1225 transitions. [2024-10-11 21:21:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 21:21:59,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:59,428 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:59,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 21:21:59,428 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:21:59,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1423519387, now seen corresponding path program 1 times [2024-10-11 21:21:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:59,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248209205] [2024-10-11 21:21:59,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:59,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:21:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:21:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 21:21:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:21:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:21:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 21:21:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 21:21:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:21:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 21:21:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:21:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-11 21:21:59,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:59,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248209205] [2024-10-11 21:21:59,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248209205] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:59,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019570549] [2024-10-11 21:21:59,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:59,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:59,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:59,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:59,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:21:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:59,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:21:59,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 21:21:59,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:59,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019570549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:59,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:59,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-10-11 21:21:59,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780476869] [2024-10-11 21:21:59,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:59,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:21:59,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:59,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:21:59,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:21:59,718 INFO L87 Difference]: Start difference. First operand 922 states and 1225 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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) [2024-10-11 21:21:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:59,874 INFO L93 Difference]: Finished difference Result 2214 states and 2941 transitions. [2024-10-11 21:21:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:21:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 88 [2024-10-11 21:21:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:59,880 INFO L225 Difference]: With dead ends: 2214 [2024-10-11 21:21:59,880 INFO L226 Difference]: Without dead ends: 1676 [2024-10-11 21:21:59,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:21:59,882 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 201 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:59,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1105 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:21:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2024-10-11 21:21:59,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1302. [2024-10-11 21:21:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 903 states have (on average 1.2868217054263567) internal successors, (1162), 935 states have internal predecessors, (1162), 270 states have call successors, (270), 112 states have call predecessors, (270), 121 states have return successors, (303), 272 states have call predecessors, (303), 270 states have call successors, (303) [2024-10-11 21:21:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1735 transitions. [2024-10-11 21:21:59,940 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1735 transitions. Word has length 88 [2024-10-11 21:21:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:59,940 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1735 transitions. [2024-10-11 21:21:59,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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) [2024-10-11 21:21:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1735 transitions. [2024-10-11 21:21:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 21:21:59,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:59,941 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:59,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 21:22:00,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 21:22:00,142 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:22:00,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:00,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1189980259, now seen corresponding path program 1 times [2024-10-11 21:22:00,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:00,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099046857] [2024-10-11 21:22:00,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:22:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:22:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 21:22:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:22:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 21:22:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 21:22:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:22:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 21:22:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:22:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-11 21:22:00,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:00,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099046857] [2024-10-11 21:22:00,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099046857] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:22:00,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423809930] [2024-10-11 21:22:00,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:00,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:00,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:22:00,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:22:00,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:22:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:22:00,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:22:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 21:22:00,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:22:00,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423809930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:22:00,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:22:00,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-10-11 21:22:00,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571255020] [2024-10-11 21:22:00,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:22:00,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:22:00,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:00,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:22:00,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:22:00,478 INFO L87 Difference]: Start difference. First operand 1302 states and 1735 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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) [2024-10-11 21:22:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:00,644 INFO L93 Difference]: Finished difference Result 2618 states and 3475 transitions. [2024-10-11 21:22:00,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:22:00,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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 91 [2024-10-11 21:22:00,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:00,653 INFO L225 Difference]: With dead ends: 2618 [2024-10-11 21:22:00,653 INFO L226 Difference]: Without dead ends: 2072 [2024-10-11 21:22:00,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:22:00,656 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 201 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:00,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1105 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:22:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2024-10-11 21:22:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1302. [2024-10-11 21:22:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 903 states have (on average 1.2868217054263567) internal successors, (1162), 935 states have internal predecessors, (1162), 270 states have call successors, (270), 112 states have call predecessors, (270), 121 states have return successors, (303), 272 states have call predecessors, (303), 270 states have call successors, (303) [2024-10-11 21:22:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1735 transitions. [2024-10-11 21:22:00,760 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1735 transitions. Word has length 91 [2024-10-11 21:22:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:00,761 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1735 transitions. [2024-10-11 21:22:00,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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) [2024-10-11 21:22:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1735 transitions. [2024-10-11 21:22:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 21:22:00,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:00,762 INFO L215 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, 1, 1, 1, 1, 1] [2024-10-11 21:22:00,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 21:22:00,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 21:22:00,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:22:00,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:00,964 INFO L85 PathProgramCache]: Analyzing trace with hash 921395845, now seen corresponding path program 1 times [2024-10-11 21:22:00,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:00,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111880612] [2024-10-11 21:22:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:00,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:22:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:22:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:22:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:22:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:22:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:22:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 21:22:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 21:22:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,228 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 21:22:01,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:01,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111880612] [2024-10-11 21:22:01,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111880612] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:22:01,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718265135] [2024-10-11 21:22:01,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:01,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:01,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:22:01,232 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:22:01,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 21:22:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 21:22:01,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:22:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 21:22:01,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:22:01,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718265135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:22:01,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:22:01,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2024-10-11 21:22:01,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132664023] [2024-10-11 21:22:01,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:22:01,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:22:01,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:01,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:22:01,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:22:01,691 INFO L87 Difference]: Start difference. First operand 1302 states and 1735 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 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) [2024-10-11 21:22:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:02,038 INFO L93 Difference]: Finished difference Result 1320 states and 1744 transitions. [2024-10-11 21:22:02,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:22:02,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 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 95 [2024-10-11 21:22:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:02,042 INFO L225 Difference]: With dead ends: 1320 [2024-10-11 21:22:02,042 INFO L226 Difference]: Without dead ends: 651 [2024-10-11 21:22:02,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-11 21:22:02,044 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 347 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:02,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 368 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:22:02,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-10-11 21:22:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2024-10-11 21:22:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 450 states have (on average 1.2822222222222222) internal successors, (577), 466 states have internal predecessors, (577), 136 states have call successors, (136), 56 states have call predecessors, (136), 59 states have return successors, (139), 137 states have call predecessors, (139), 136 states have call successors, (139) [2024-10-11 21:22:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 852 transitions. [2024-10-11 21:22:02,079 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 852 transitions. Word has length 95 [2024-10-11 21:22:02,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:02,079 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 852 transitions. [2024-10-11 21:22:02,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 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) [2024-10-11 21:22:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 852 transitions. [2024-10-11 21:22:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 21:22:02,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:02,081 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:22:02,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 21:22:02,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 21:22:02,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:22:02,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:02,282 INFO L85 PathProgramCache]: Analyzing trace with hash -152836006, now seen corresponding path program 1 times [2024-10-11 21:22:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:02,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301562677] [2024-10-11 21:22:02,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:02,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:22:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:22:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 21:22:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:22:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:22:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:22:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:22:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 21:22:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:22:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 21:22:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:22:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 21:22:02,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:02,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301562677] [2024-10-11 21:22:02,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301562677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:22:02,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:22:02,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:22:02,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531643385] [2024-10-11 21:22:02,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:22:02,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:22:02,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:02,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:22:02,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:22:02,393 INFO L87 Difference]: Start difference. First operand 651 states and 852 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 21:22:02,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:02,676 INFO L93 Difference]: Finished difference Result 1310 states and 1716 transitions. [2024-10-11 21:22:02,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:22:02,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (14), 4 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 108 [2024-10-11 21:22:02,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:02,680 INFO L225 Difference]: With dead ends: 1310 [2024-10-11 21:22:02,680 INFO L226 Difference]: Without dead ends: 679 [2024-10-11 21:22:02,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:22:02,682 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 80 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:02,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 411 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:22:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-10-11 21:22:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 651. [2024-10-11 21:22:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 450 states have (on average 1.2755555555555556) internal successors, (574), 463 states have internal predecessors, (574), 136 states have call successors, (136), 56 states have call predecessors, (136), 59 states have return successors, (139), 137 states have call predecessors, (139), 136 states have call successors, (139) [2024-10-11 21:22:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 849 transitions. [2024-10-11 21:22:02,723 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 849 transitions. Word has length 108 [2024-10-11 21:22:02,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:02,724 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 849 transitions. [2024-10-11 21:22:02,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 21:22:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 849 transitions. [2024-10-11 21:22:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 21:22:02,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:02,725 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:22:02,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 21:22:02,726 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)] === [2024-10-11 21:22:02,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:02,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2106137157, now seen corresponding path program 1 times [2024-10-11 21:22:02,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:02,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79037026] [2024-10-11 21:22:02,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:02,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:22:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:22:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 21:22:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:22:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:22:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:22:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 21:22:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 21:22:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 21:22:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:22:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 21:22:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:22:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 21:22:02,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:02,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79037026] [2024-10-11 21:22:02,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79037026] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:22:02,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314014421] [2024-10-11 21:22:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:02,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:02,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:22:02,857 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:22:02,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 21:22:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:22:03,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:22:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 21:22:03,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:22:03,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314014421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:22:03,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:22:03,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 21:22:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207863328] [2024-10-11 21:22:03,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:22:03,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:22:03,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:03,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:22:03,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:22:03,054 INFO L87 Difference]: Start difference. First operand 651 states and 849 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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) [2024-10-11 21:22:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:03,146 INFO L93 Difference]: Finished difference Result 651 states and 849 transitions. [2024-10-11 21:22:03,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:22:03,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 111 [2024-10-11 21:22:03,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:03,149 INFO L225 Difference]: With dead ends: 651 [2024-10-11 21:22:03,149 INFO L226 Difference]: Without dead ends: 650 [2024-10-11 21:22:03,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:22:03,151 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:03,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 426 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:22:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-10-11 21:22:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2024-10-11 21:22:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 450 states have (on average 1.2733333333333334) internal successors, (573), 462 states have internal predecessors, (573), 136 states have call successors, (136), 56 states have call predecessors, (136), 59 states have return successors, (139), 137 states have call predecessors, (139), 136 states have call successors, (139) [2024-10-11 21:22:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 848 transitions. [2024-10-11 21:22:03,213 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 848 transitions. Word has length 111 [2024-10-11 21:22:03,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:03,213 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 848 transitions. [2024-10-11 21:22:03,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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) [2024-10-11 21:22:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 848 transitions. [2024-10-11 21:22:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 21:22:03,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:03,215 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:22:03,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 21:22:03,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:03,416 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:22:03,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:03,416 INFO L85 PathProgramCache]: Analyzing trace with hash 865742683, now seen corresponding path program 1 times [2024-10-11 21:22:03,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:03,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578453139] [2024-10-11 21:22:03,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:03,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:22:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:22:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 21:22:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:22:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:22:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:22:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 21:22:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 21:22:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 21:22:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:22:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 21:22:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:22:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 21:22:03,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:03,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578453139] [2024-10-11 21:22:03,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578453139] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:22:03,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095865051] [2024-10-11 21:22:03,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:03,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:03,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:22:03,574 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:22:03,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 21:22:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:03,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:22:03,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:22:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 21:22:03,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:22:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 21:22:03,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095865051] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:22:03,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:22:03,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2024-10-11 21:22:03,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27868136] [2024-10-11 21:22:03,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:22:03,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 21:22:03,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:03,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 21:22:03,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:22:03,877 INFO L87 Difference]: Start difference. First operand 650 states and 848 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-11 21:22:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:04,210 INFO L93 Difference]: Finished difference Result 686 states and 903 transitions. [2024-10-11 21:22:04,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 21:22:04,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 112 [2024-10-11 21:22:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:04,214 INFO L225 Difference]: With dead ends: 686 [2024-10-11 21:22:04,214 INFO L226 Difference]: Without dead ends: 685 [2024-10-11 21:22:04,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-10-11 21:22:04,214 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 94 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:04,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 413 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:22:04,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-10-11 21:22:04,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 646. [2024-10-11 21:22:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 448 states have (on average 1.2723214285714286) internal successors, (570), 459 states have internal predecessors, (570), 135 states have call successors, (135), 56 states have call predecessors, (135), 59 states have return successors, (138), 136 states have call predecessors, (138), 135 states have call successors, (138) [2024-10-11 21:22:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 843 transitions. [2024-10-11 21:22:04,265 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 843 transitions. Word has length 112 [2024-10-11 21:22:04,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:04,265 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 843 transitions. [2024-10-11 21:22:04,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-11 21:22:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 843 transitions. [2024-10-11 21:22:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 21:22:04,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:04,267 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:22:04,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 21:22:04,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 21:22:04,467 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:22:04,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:04,468 INFO L85 PathProgramCache]: Analyzing trace with hash 768546758, now seen corresponding path program 1 times [2024-10-11 21:22:04,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:04,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410310520] [2024-10-11 21:22:04,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:04,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:22:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:22:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 21:22:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:22:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:22:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:22:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 21:22:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:22:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:22:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:22:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 21:22:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:22:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 21:22:04,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:04,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410310520] [2024-10-11 21:22:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410310520] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:22:04,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503954079] [2024-10-11 21:22:04,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:04,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:04,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:22:04,612 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:22:04,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 21:22:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:22:04,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:22:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 21:22:04,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:22:04,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503954079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:22:04,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:22:04,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 21:22:04,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370953537] [2024-10-11 21:22:04,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:22:04,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:22:04,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:04,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:22:04,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:22:04,907 INFO L87 Difference]: Start difference. First operand 646 states and 843 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2024-10-11 21:22:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:05,058 INFO L93 Difference]: Finished difference Result 646 states and 843 transitions. [2024-10-11 21:22:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:22:05,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 112 [2024-10-11 21:22:05,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:05,061 INFO L225 Difference]: With dead ends: 646 [2024-10-11 21:22:05,062 INFO L226 Difference]: Without dead ends: 644 [2024-10-11 21:22:05,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:22:05,062 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 194 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:05,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 360 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:22:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-10-11 21:22:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2024-10-11 21:22:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 448 states have (on average 1.2678571428571428) internal successors, (568), 457 states have internal predecessors, (568), 135 states have call successors, (135), 56 states have call predecessors, (135), 59 states have return successors, (138), 136 states have call predecessors, (138), 135 states have call successors, (138) [2024-10-11 21:22:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 841 transitions. [2024-10-11 21:22:05,096 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 841 transitions. Word has length 112 [2024-10-11 21:22:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:05,098 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 841 transitions. [2024-10-11 21:22:05,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2024-10-11 21:22:05,098 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 841 transitions. [2024-10-11 21:22:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 21:22:05,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:05,099 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:22:05,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 21:22:05,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 21:22:05,300 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 21:22:05,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:05,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1944853923, now seen corresponding path program 1 times [2024-10-11 21:22:05,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:05,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925872035] [2024-10-11 21:22:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:05,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:22:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:22:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 21:22:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:22:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:22:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:22:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 21:22:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:22:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:22:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:22:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 21:22:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:22:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 21:22:05,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:05,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925872035] [2024-10-11 21:22:05,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925872035] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:22:05,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060430750] [2024-10-11 21:22:05,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:05,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:05,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:22:05,452 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:22:05,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 21:22:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:22:05,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:22:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 21:22:05,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:22:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 21:22:05,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060430750] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:22:05,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:22:05,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 2, 3] total 8 [2024-10-11 21:22:05,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593518714] [2024-10-11 21:22:05,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:22:05,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 21:22:05,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:05,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 21:22:05,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:22:05,850 INFO L87 Difference]: Start difference. First operand 644 states and 841 transitions. Second operand has 9 states, 8 states have (on average 21.125) internal successors, (169), 7 states have internal predecessors, (169), 6 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2024-10-11 21:22:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:06,375 INFO L93 Difference]: Finished difference Result 667 states and 873 transitions. [2024-10-11 21:22:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:22:06,376 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 21.125) internal successors, (169), 7 states have internal predecessors, (169), 6 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) Word has length 113 [2024-10-11 21:22:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:06,377 INFO L225 Difference]: With dead ends: 667 [2024-10-11 21:22:06,377 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:22:06,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2024-10-11 21:22:06,378 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 830 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:06,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 378 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:22:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:22:06,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:22:06,379 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) [2024-10-11 21:22:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:22:06,379 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2024-10-11 21:22:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:06,379 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:22:06,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 21.125) internal successors, (169), 7 states have internal predecessors, (169), 6 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2024-10-11 21:22:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:22:06,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:22:06,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-10-11 21:22:06,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-10-11 21:22:06,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-10-11 21:22:06,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-10-11 21:22:06,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-10-11 21:22:06,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-10-11 21:22:06,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-10-11 21:22:06,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-10-11 21:22:06,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-10-11 21:22:06,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-10-11 21:22:06,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-10-11 21:22:06,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-10-11 21:22:06,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-10-11 21:22:06,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-10-11 21:22:06,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-10-11 21:22:06,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-10-11 21:22:06,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 21:22:06,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 21:22:06,586 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:22:06,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:22:13,810 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:22:13,822 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 21:22:13,822 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 21:22:13,822 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 21:22:13,828 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 21:22:13,829 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 21:22:13,829 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 21:22:13,842 WARN L155 FloydHoareUtils]: Requires clause for s3c_hwmon_probe contained old-variable. Original clause: (and (= |old(#length)| |#length|) (<= ~ldv_count_1~0 0) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (<= ~ref_cnt~0 0) (= |old(~ldv_count_2~0)| 0) (<= ~probed_1~0 0) (= |#memory_int#2| |old(#memory_int#2)|) (<= 0 ~ref_cnt~0) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= ~ldv_state_variable_0~0 2) (= ~ldv_count_2~0 0) (= |old(#valid)| |#valid|)) Eliminated clause: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2024-10-11 21:22:13,846 WARN L155 FloydHoareUtils]: Requires clause for platform_get_drvdata contained old-variable. Original clause: (and (= |old(#length)| |#length|) (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (= ~ldv_state_variable_0~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (= |old(#valid)| |#valid|) (<= ~ref_cnt~0 1)) Eliminated clause: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 1) (= ~ldv_count_2~0 0)) [2024-10-11 21:22:13,854 WARN L155 FloydHoareUtils]: Requires clause for s3c_hwmon_remove contained old-variable. Original clause: (and (= |old(#length)| |#length|) (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (= ~ldv_state_variable_0~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (= |old(#valid)| |#valid|) (<= ~ref_cnt~0 1)) Eliminated clause: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 1) (= ~ldv_count_2~0 0)) [2024-10-11 21:22:13,861 WARN L155 FloydHoareUtils]: Requires clause for ldv_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|) (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_count_2~0 0))) (or (and .cse0 (= ~ldv_state_variable_1~0 2) .cse1 (<= 1 ~ref_cnt~0) .cse2 (<= ~ref_cnt~0 1)) (and .cse0 (<= ~ref_cnt~0 0) (<= ~probed_1~0 0) (<= 0 ~ref_cnt~0) .cse1 .cse2)))) Eliminated clause: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_count_2~0 0))) (or (and .cse0 (= ~ldv_state_variable_1~0 2) .cse1 (= ~ref_cnt~0 1) .cse2) (and .cse0 (<= ~probed_1~0 0) .cse1 (= ~ref_cnt~0 0) .cse2))) [2024-10-11 21:22:13,866 WARN L155 FloydHoareUtils]: Requires clause for #Ultimate.meminit contained old-variable. Original clause: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= ~probed_1~0 0) (= |#memory_int#2| |old(#memory_int#2)|) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_0~0 2) (= ~ldv_count_2~0 0)) Eliminated clause: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2024-10-11 21:22:13,867 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 [2024-10-11 21:22:13,867 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~probed_1~0 [2024-10-11 21:22:13,867 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 [2024-10-11 21:22:13,867 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ref_cnt~0 [2024-10-11 21:22:13,867 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 [2024-10-11 21:22:13,867 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 [2024-10-11 21:22:13,871 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~probed_1~0 [2024-10-11 21:22:13,871 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 [2024-10-11 21:22:13,871 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ref_cnt~0 [2024-10-11 21:22:13,871 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 [2024-10-11 21:22:13,879 WARN L155 FloydHoareUtils]: Requires clause for ldv_device_create_file contained old-variable. Original clause: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (= |old(~ldv_count_2~0)| 0) (<= ~probed_1~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_0~0 2) (= ~ldv_count_2~0 0)) Eliminated clause: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2024-10-11 21:22:13,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:22:13 BoogieIcfgContainer [2024-10-11 21:22:13,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:22:13,885 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:22:13,885 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:22:13,886 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:22:13,886 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:21:52" (3/4) ... [2024-10-11 21:22:13,887 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:22:13,890 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2024-10-11 21:22:13,890 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_probe [2024-10-11 21:22:13,890 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2024-10-11 21:22:13,890 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2024-10-11 21:22:13,890 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 21:22:13,890 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove [2024-10-11 21:22:13,890 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2024-10-11 21:22:13,891 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2024-10-11 21:22:13,891 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2024-10-11 21:22:13,891 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2024-10-11 21:22:13,891 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-10-11 21:22:13,891 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2024-10-11 21:22:13,891 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2024-10-11 21:22:13,891 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2024-10-11 21:22:13,891 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2024-10-11 21:22:13,891 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2024-10-11 21:22:13,891 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file [2024-10-11 21:22:13,891 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2024-10-11 21:22:13,907 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 94 nodes and edges [2024-10-11 21:22:13,908 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2024-10-11 21:22:13,909 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 21:22:13,910 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 21:22:13,910 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:22:13,934 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) && (ldv_count_2 == 0)) [2024-10-11 21:22:13,936 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_count_1 <= 0) && (0 <= i)) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (i <= 2147483645)) && (ldv_state_variable_0 == 2)) && (ldv_count_2 == 0)) [2024-10-11 21:22:13,939 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)) [2024-10-11 21:22:13,940 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)) [2024-10-11 21:22:13,990 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)) [2024-10-11 21:22:13,990 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_count_1 <= 0) && (0 <= i)) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (i <= 2147483645)) && (ldv_state_variable_0 == 2)) && (ldv_count_2 == 0)) [2024-10-11 21:22:13,991 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)) [2024-10-11 21:22:13,991 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) && (ldv_count_2 == 0)) [2024-10-11 21:22:14,051 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:22:14,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:22:14,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:22:14,052 INFO L158 Benchmark]: Toolchain (without parser) took 23000.51ms. Allocated memory was 182.5MB in the beginning and 725.6MB in the end (delta: 543.2MB). Free memory was 146.4MB in the beginning and 493.3MB in the end (delta: -346.9MB). Peak memory consumption was 195.8MB. Max. memory is 16.1GB. [2024-10-11 21:22:14,052 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:22:14,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.83ms. Allocated memory is still 182.5MB. Free memory was 146.4MB in the beginning and 113.5MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 21:22:14,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.97ms. Allocated memory is still 182.5MB. Free memory was 113.5MB in the beginning and 108.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 21:22:14,053 INFO L158 Benchmark]: Boogie Preprocessor took 101.57ms. Allocated memory is still 182.5MB. Free memory was 108.2MB in the beginning and 98.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 21:22:14,053 INFO L158 Benchmark]: RCFGBuilder took 842.08ms. Allocated memory is still 182.5MB. Free memory was 98.8MB in the beginning and 126.0MB in the end (delta: -27.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-10-11 21:22:14,054 INFO L158 Benchmark]: TraceAbstraction took 21274.72ms. Allocated memory was 182.5MB in the beginning and 725.6MB in the end (delta: 543.2MB). Free memory was 124.9MB in the beginning and 508.0MB in the end (delta: -383.1MB). Peak memory consumption was 423.3MB. Max. memory is 16.1GB. [2024-10-11 21:22:14,056 INFO L158 Benchmark]: Witness Printer took 166.50ms. Allocated memory is still 725.6MB. Free memory was 508.0MB in the beginning and 493.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 21:22:14,057 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.14ms. Allocated memory is still 117.4MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.83ms. Allocated memory is still 182.5MB. Free memory was 146.4MB in the beginning and 113.5MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.97ms. Allocated memory is still 182.5MB. Free memory was 113.5MB in the beginning and 108.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.57ms. Allocated memory is still 182.5MB. Free memory was 108.2MB in the beginning and 98.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 842.08ms. Allocated memory is still 182.5MB. Free memory was 98.8MB in the beginning and 126.0MB in the end (delta: -27.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21274.72ms. Allocated memory was 182.5MB in the beginning and 725.6MB in the end (delta: 543.2MB). Free memory was 124.9MB in the beginning and 508.0MB in the end (delta: -383.1MB). Peak memory consumption was 423.3MB. Max. memory is 16.1GB. * Witness Printer took 166.50ms. Allocated memory is still 725.6MB. Free memory was 508.0MB in the beginning and 493.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~probed_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ref_cnt~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~probed_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ref_cnt~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 217 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3967 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3680 mSDsluCounter, 9702 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5864 mSDsCounter, 1670 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4304 IncrementalHoareTripleChecker+Invalid, 5974 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1670 mSolverCounterUnsat, 3838 mSDtfsCounter, 4304 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1673 GetRequests, 1564 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1447occurred in iteration=9, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 1742 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2364 NumberOfCodeBlocks, 2364 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2630 ConstructedInterpolants, 0 QuantifiedInterpolants, 5033 SizeOfPredicates, 3 NumberOfNonLiveVariables, 5782 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 31 InterpolantComputations, 15 PerfectInterpolantSequences, 722/797 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 1115]: Location Invariant Derived location invariant: (((((((((ldv_count_1 <= 0) && (0 <= i)) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (i <= 2147483645)) && (ldv_state_variable_0 == 2)) && (ldv_count_2 == 0)) - InvariantResult [Line: 1324]: Location Invariant Derived location invariant: ((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) && (ldv_count_2 == 0)) - InvariantResult [Line: 1155]: Location Invariant Derived location invariant: (((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && ((i == 0) || ((i <= 2147483645) && (1 <= i)))) && (1 <= ref_cnt)) && (ldv_count_2 == 0)) && (ref_cnt <= 1)) - InvariantResult [Line: 1053]: Location Invariant Derived location invariant: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) && (ldv_count_2 == 0)) - InvariantResult [Line: 876]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 1015]: Loop Invariant Derived loop invariant: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && ((ldv_count_2 == 0) || (ldv_count_2 == 0))) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: (((((((ldv_count_1 <= 0) && (ref_cnt <= 0)) && (\old(ldv_count_2) == 0)) && ((ldv_count_2 == 0) || (ldv_count_2 == 0))) && (probed_1 <= 0)) && (0 <= ref_cnt)) && (ldv_state_variable_0 == 2)) - ProcedureContractResult [Line: 940]: Procedure Contract for s3c_hwmon_remove_raw Derived contract for procedure s3c_hwmon_remove_raw. Requires: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) Ensures: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) - ProcedureContractResult [Line: 1040]: Procedure Contract for s3c_hwmon_probe Derived contract for procedure s3c_hwmon_probe. Requires: (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) Ensures: ((((((ldv_count_1 <= 0) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 895]: Procedure Contract for platform_get_drvdata Derived contract for procedure platform_get_drvdata. Requires: (((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) Ensures: (((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 860]: Procedure Contract for ldv_undef_int Derived contract for procedure ldv_undef_int. Requires: (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) Ensures: (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 800]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) Ensures: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) - ProcedureContractResult [Line: 1150]: Procedure Contract for s3c_hwmon_remove Derived contract for procedure s3c_hwmon_remove. Requires: (((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) Ensures: (((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 1324]: Procedure Contract for PTR_ERR Derived contract for procedure PTR_ERR. Requires: (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) Ensures: (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 1385]: Procedure Contract for ldv_is_err Derived contract for procedure ldv_is_err. Requires: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) Ensures: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) - ProcedureContractResult [Line: 1482]: Procedure Contract for hwmon_device_unregister Derived contract for procedure hwmon_device_unregister. Requires: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) Ensures: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) - ProcedureContractResult [Line: 1459]: Procedure Contract for dev_err Derived contract for procedure dev_err. Requires: (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) Ensures: (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 805]: Procedure Contract for ldv_malloc Derived contract for procedure ldv_malloc. Requires: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) Ensures: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) - ProcedureContractResult [Line: 1476]: Procedure Contract for device_remove_file Derived contract for procedure device_remove_file. Requires: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) Ensures: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) - ProcedureContractResult [Line: 1509]: Procedure Contract for s3c_adc_release Derived contract for procedure s3c_adc_release. Requires: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) Ensures: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) - ProcedureContractResult [Line: 1032]: Procedure Contract for s3c_hwmon_remove_attr Derived contract for procedure s3c_hwmon_remove_attr. Requires: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) Ensures: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) - ProcedureContractResult [Line: 1430]: Procedure Contract for ldv_device_create_file Derived contract for procedure ldv_device_create_file. Requires: (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) Ensures: ((((((ldv_count_1 <= 0) && (\old(ldv_count_2) == 0)) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 1332]: Procedure Contract for IS_ERR Derived contract for procedure IS_ERR. Requires: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) Ensures: ((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:22:14,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE