/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:33:55,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:33:55,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:33:55,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:33:55,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:33:55,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:33:55,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:33:55,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:33:55,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:33:55,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:33:55,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:33:55,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:33:55,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:33:55,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:33:55,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:33:55,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:33:55,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:33:55,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:33:55,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:33:55,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:33:55,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:33:55,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:33:55,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:33:55,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:33:55,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:33:55,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:33:55,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:33:55,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:33:55,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:33:55,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:33:55,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:33:55,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:33:55,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:33:55,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:33:55,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:33:55,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:33:55,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:33:55,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:33:55,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:33:55,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:33:55,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:33:55,540 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 21:33:55,570 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:33:55,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:33:55,571 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:33:55,571 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:33:55,572 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:33:55,572 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:33:55,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:33:55,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:33:55,574 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:33:55,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:33:55,574 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:33:55,575 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:33:55,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:33:55,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:33:55,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:33:55,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:33:55,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:33:55,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:33:55,576 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:33:55,576 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:33:55,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:33:55,577 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:33:55,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:33:55,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:33:55,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:33:55,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:33:55,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:33:55,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:33:55,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:33:55,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:33:55,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:33:55,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:33:55,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:33:55,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/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 [2022-10-15 21:33:55,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:33:56,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:33:56,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:33:56,030 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:33:56,030 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:33:56,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-10-15 21:33:56,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85beff799/a0fd9a7f6dd545b29e0719bbca677375/FLAGcf4ee11a9 [2022-10-15 21:33:57,084 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:33:57,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-10-15 21:33:57,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85beff799/a0fd9a7f6dd545b29e0719bbca677375/FLAGcf4ee11a9 [2022-10-15 21:33:57,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85beff799/a0fd9a7f6dd545b29e0719bbca677375 [2022-10-15 21:33:57,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:33:57,276 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:33:57,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:33:57,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:33:57,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:33:57,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:33:57" (1/1) ... [2022-10-15 21:33:57,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3872a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:57, skipping insertion in model container [2022-10-15 21:33:57,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:33:57" (1/1) ... [2022-10-15 21:33:57,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:33:57,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:33:57,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i[24075,24088] [2022-10-15 21:33:57,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:33:57,974 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:33:58,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i[24075,24088] [2022-10-15 21:33:58,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:33:58,284 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:33:58,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:58 WrapperNode [2022-10-15 21:33:58,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:33:58,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:33:58,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:33:58,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:33:58,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:58" (1/1) ... [2022-10-15 21:33:58,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:58" (1/1) ... [2022-10-15 21:33:58,446 INFO L138 Inliner]: procedures = 78, calls = 165, calls flagged for inlining = 30, calls inlined = 26, statements flattened = 521 [2022-10-15 21:33:58,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:33:58,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:33:58,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:33:58,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:33:58,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:58" (1/1) ... [2022-10-15 21:33:58,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:58" (1/1) ... [2022-10-15 21:33:58,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:58" (1/1) ... [2022-10-15 21:33:58,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:58" (1/1) ... [2022-10-15 21:33:58,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:58" (1/1) ... [2022-10-15 21:33:58,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:58" (1/1) ... [2022-10-15 21:33:58,558 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:58" (1/1) ... [2022-10-15 21:33:58,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:58" (1/1) ... [2022-10-15 21:33:58,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:33:58,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:33:58,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:33:58,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:33:58,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:58" (1/1) ... [2022-10-15 21:33:58,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:33:58,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:33:58,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 21:33:58,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 21:33:58,705 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2022-10-15 21:33:58,705 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2022-10-15 21:33:58,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:33:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 21:33:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:33:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-15 21:33:58,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-15 21:33:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:33:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:33:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-10-15 21:33:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-10-15 21:33:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-10-15 21:33:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-10-15 21:33:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-15 21:33:58,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-15 21:33:58,708 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2022-10-15 21:33:58,708 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2022-10-15 21:33:58,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:33:58,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 21:33:58,709 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-10-15 21:33:58,709 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-10-15 21:33:58,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-10-15 21:33:58,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-10-15 21:33:58,709 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2022-10-15 21:33:58,709 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2022-10-15 21:33:58,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:33:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-15 21:33:58,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-15 21:33:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2022-10-15 21:33:58,710 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2022-10-15 21:33:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-15 21:33:58,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-15 21:33:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:33:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:33:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-10-15 21:33:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-10-15 21:33:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-10-15 21:33:58,712 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-10-15 21:33:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:33:58,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:33:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-10-15 21:33:58,712 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-10-15 21:33:58,952 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:33:58,955 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:33:59,177 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-15 21:33:59,784 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:33:59,798 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:33:59,799 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 21:33:59,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:33:59 BoogieIcfgContainer [2022-10-15 21:33:59,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:33:59,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:33:59,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:33:59,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:33:59,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:33:57" (1/3) ... [2022-10-15 21:33:59,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782ee2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:33:59, skipping insertion in model container [2022-10-15 21:33:59,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:33:58" (2/3) ... [2022-10-15 21:33:59,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782ee2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:33:59, skipping insertion in model container [2022-10-15 21:33:59,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:33:59" (3/3) ... [2022-10-15 21:33:59,814 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-10-15 21:33:59,842 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:33:59,842 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-10-15 21:33:59,919 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:33:59,929 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5537fd06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:33:59,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-10-15 21:33:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 144 states have (on average 1.3611111111111112) internal successors, (196), 163 states have internal predecessors, (196), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-10-15 21:33:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 21:33:59,949 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:33:59,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:33:59,951 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:33:59,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:33:59,959 INFO L85 PathProgramCache]: Analyzing trace with hash 40388831, now seen corresponding path program 1 times [2022-10-15 21:33:59,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:33:59,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997766827] [2022-10-15 21:33:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:33:59,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:34:00,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:00,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997766827] [2022-10-15 21:34:00,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997766827] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:00,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:00,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:34:00,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067747952] [2022-10-15 21:34:00,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:00,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:34:00,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:00,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:34:00,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:34:00,431 INFO L87 Difference]: Start difference. First operand has 207 states, 144 states have (on average 1.3611111111111112) internal successors, (196), 163 states have internal predecessors, (196), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:34:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:00,550 INFO L93 Difference]: Finished difference Result 436 states and 568 transitions. [2022-10-15 21:34:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:34:00,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 21:34:00,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:00,576 INFO L225 Difference]: With dead ends: 436 [2022-10-15 21:34:00,577 INFO L226 Difference]: Without dead ends: 209 [2022-10-15 21:34:00,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:34:00,589 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 35 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:00,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 501 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:34:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-10-15 21:34:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-10-15 21:34:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 166 states have internal predecessors, (204), 30 states have call successors, (30), 13 states have call predecessors, (30), 13 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-10-15 21:34:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 264 transitions. [2022-10-15 21:34:00,714 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 264 transitions. Word has length 12 [2022-10-15 21:34:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:00,714 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 264 transitions. [2022-10-15 21:34:00,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:34:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 264 transitions. [2022-10-15 21:34:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 21:34:00,718 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:00,718 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:00,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:34:00,719 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:00,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1751225976, now seen corresponding path program 1 times [2022-10-15 21:34:00,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:00,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042459152] [2022-10-15 21:34:00,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:00,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:00,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 21:34:01,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:01,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042459152] [2022-10-15 21:34:01,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042459152] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:01,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:01,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:34:01,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268257893] [2022-10-15 21:34:01,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:01,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:34:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:01,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:34:01,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:01,016 INFO L87 Difference]: Start difference. First operand 209 states and 264 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:34:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:01,707 INFO L93 Difference]: Finished difference Result 635 states and 806 transitions. [2022-10-15 21:34:01,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:34:01,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-10-15 21:34:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:01,724 INFO L225 Difference]: With dead ends: 635 [2022-10-15 21:34:01,724 INFO L226 Difference]: Without dead ends: 429 [2022-10-15 21:34:01,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:34:01,734 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 312 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:01,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 867 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 21:34:01,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-10-15 21:34:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 211. [2022-10-15 21:34:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 168 states have internal predecessors, (206), 30 states have call successors, (30), 13 states have call predecessors, (30), 13 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-10-15 21:34:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 266 transitions. [2022-10-15 21:34:01,825 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 266 transitions. Word has length 30 [2022-10-15 21:34:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:01,826 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 266 transitions. [2022-10-15 21:34:01,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:34:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 266 transitions. [2022-10-15 21:34:01,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-15 21:34:01,832 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:01,833 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:01,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:34:01,833 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:01,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:01,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1454789785, now seen corresponding path program 1 times [2022-10-15 21:34:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:01,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896477180] [2022-10-15 21:34:01,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:02,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:02,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:34:02,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:02,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896477180] [2022-10-15 21:34:02,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896477180] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:02,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:02,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:34:02,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43089649] [2022-10-15 21:34:02,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:02,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:34:02,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:02,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:34:02,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:02,088 INFO L87 Difference]: Start difference. First operand 211 states and 266 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:34:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:02,709 INFO L93 Difference]: Finished difference Result 640 states and 811 transitions. [2022-10-15 21:34:02,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:34:02,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-10-15 21:34:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:02,718 INFO L225 Difference]: With dead ends: 640 [2022-10-15 21:34:02,721 INFO L226 Difference]: Without dead ends: 432 [2022-10-15 21:34:02,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:34:02,730 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 312 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:02,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 867 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 21:34:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-10-15 21:34:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 211. [2022-10-15 21:34:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 168 states have internal predecessors, (206), 30 states have call successors, (30), 13 states have call predecessors, (30), 13 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-10-15 21:34:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 266 transitions. [2022-10-15 21:34:02,787 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 266 transitions. Word has length 38 [2022-10-15 21:34:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:02,793 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 266 transitions. [2022-10-15 21:34:02,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:34:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 266 transitions. [2022-10-15 21:34:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-15 21:34:02,800 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:02,801 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:34:02,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:34:02,802 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:02,803 INFO L85 PathProgramCache]: Analyzing trace with hash 305024916, now seen corresponding path program 1 times [2022-10-15 21:34:02,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:02,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84757530] [2022-10-15 21:34:02,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:02,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:02,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:02,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:02,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:02,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-15 21:34:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:02,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:02,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:02,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-15 21:34:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 21:34:03,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:03,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84757530] [2022-10-15 21:34:03,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84757530] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:03,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:03,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:34:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053441987] [2022-10-15 21:34:03,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:03,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:34:03,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:03,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:34:03,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:03,008 INFO L87 Difference]: Start difference. First operand 211 states and 266 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 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) [2022-10-15 21:34:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:03,344 INFO L93 Difference]: Finished difference Result 485 states and 607 transitions. [2022-10-15 21:34:03,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:34:03,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 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 58 [2022-10-15 21:34:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:03,348 INFO L225 Difference]: With dead ends: 485 [2022-10-15 21:34:03,348 INFO L226 Difference]: Without dead ends: 277 [2022-10-15 21:34:03,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:34:03,353 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 221 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:03,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 625 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 21:34:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-10-15 21:34:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 267. [2022-10-15 21:34:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 197 states have (on average 1.3147208121827412) internal successors, (259), 211 states have internal predecessors, (259), 35 states have call successors, (35), 21 states have call predecessors, (35), 21 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-10-15 21:34:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 329 transitions. [2022-10-15 21:34:03,406 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 329 transitions. Word has length 58 [2022-10-15 21:34:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:03,407 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 329 transitions. [2022-10-15 21:34:03,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 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) [2022-10-15 21:34:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 329 transitions. [2022-10-15 21:34:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-15 21:34:03,413 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:03,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:03,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:34:03,414 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:03,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash 756150245, now seen corresponding path program 1 times [2022-10-15 21:34:03,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:03,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291437529] [2022-10-15 21:34:03,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:03,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:03,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:03,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:34:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:03,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:03,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:03,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:34:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:34:03,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:03,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291437529] [2022-10-15 21:34:03,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291437529] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:03,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:03,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:34:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570215232] [2022-10-15 21:34:03,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:03,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:34:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:03,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:34:03,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:03,748 INFO L87 Difference]: Start difference. First operand 267 states and 329 transitions. Second operand has 5 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-15 21:34:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:04,159 INFO L93 Difference]: Finished difference Result 464 states and 576 transitions. [2022-10-15 21:34:04,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:34:04,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2022-10-15 21:34:04,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:04,170 INFO L225 Difference]: With dead ends: 464 [2022-10-15 21:34:04,170 INFO L226 Difference]: Without dead ends: 462 [2022-10-15 21:34:04,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:34:04,175 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 215 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:04,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 674 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 21:34:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-10-15 21:34:04,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 440. [2022-10-15 21:34:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 334 states have (on average 1.311377245508982) internal successors, (438), 349 states have internal predecessors, (438), 59 states have call successors, (59), 33 states have call predecessors, (59), 33 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-10-15 21:34:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 556 transitions. [2022-10-15 21:34:04,237 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 556 transitions. Word has length 67 [2022-10-15 21:34:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:04,238 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 556 transitions. [2022-10-15 21:34:04,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-15 21:34:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 556 transitions. [2022-10-15 21:34:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-15 21:34:04,240 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:04,240 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:34:04,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:34:04,241 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1424541863, now seen corresponding path program 1 times [2022-10-15 21:34:04,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:04,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548637296] [2022-10-15 21:34:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:04,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:04,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:04,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:34:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:04,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:04,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:04,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:34:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:04,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:34:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:04,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:34:04,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:04,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548637296] [2022-10-15 21:34:04,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548637296] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:04,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:04,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:34:04,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787362584] [2022-10-15 21:34:04,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:04,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:34:04,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:04,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:34:04,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:04,448 INFO L87 Difference]: Start difference. First operand 440 states and 556 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-15 21:34:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:04,803 INFO L93 Difference]: Finished difference Result 922 states and 1181 transitions. [2022-10-15 21:34:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:34:04,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2022-10-15 21:34:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:04,809 INFO L225 Difference]: With dead ends: 922 [2022-10-15 21:34:04,809 INFO L226 Difference]: Without dead ends: 502 [2022-10-15 21:34:04,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:04,812 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 65 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:04,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 619 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 21:34:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-10-15 21:34:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 488. [2022-10-15 21:34:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 376 states have (on average 1.3138297872340425) internal successors, (494), 391 states have internal predecessors, (494), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-10-15 21:34:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 624 transitions. [2022-10-15 21:34:04,862 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 624 transitions. Word has length 80 [2022-10-15 21:34:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:04,863 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 624 transitions. [2022-10-15 21:34:04,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-15 21:34:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 624 transitions. [2022-10-15 21:34:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-10-15 21:34:04,866 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:04,866 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:04,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:34:04,866 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:04,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:04,867 INFO L85 PathProgramCache]: Analyzing trace with hash -254840849, now seen corresponding path program 1 times [2022-10-15 21:34:04,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:04,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212162761] [2022-10-15 21:34:04,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:04,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:34:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:34:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:34:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:34:05,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:05,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212162761] [2022-10-15 21:34:05,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212162761] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:34:05,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965793586] [2022-10-15 21:34:05,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:05,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:34:05,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:34:05,092 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:34:05,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 21:34:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:05,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:34:05,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:34:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:34:05,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:34:05,461 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:34:05,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965793586] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:34:05,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:34:05,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-10-15 21:34:05,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419501382] [2022-10-15 21:34:05,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:34:05,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 21:34:05,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:05,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 21:34:05,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:34:05,465 INFO L87 Difference]: Start difference. First operand 488 states and 624 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-15 21:34:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:06,081 INFO L93 Difference]: Finished difference Result 936 states and 1269 transitions. [2022-10-15 21:34:06,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:34:06,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (11), 3 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 85 [2022-10-15 21:34:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:06,089 INFO L225 Difference]: With dead ends: 936 [2022-10-15 21:34:06,089 INFO L226 Difference]: Without dead ends: 932 [2022-10-15 21:34:06,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:34:06,091 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 340 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:06,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1367 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 21:34:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-10-15 21:34:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 537. [2022-10-15 21:34:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 420 states have (on average 1.3142857142857143) internal successors, (552), 432 states have internal predecessors, (552), 73 states have call successors, (73), 33 states have call predecessors, (73), 33 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2022-10-15 21:34:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 698 transitions. [2022-10-15 21:34:06,154 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 698 transitions. Word has length 85 [2022-10-15 21:34:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:06,154 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 698 transitions. [2022-10-15 21:34:06,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-15 21:34:06,155 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 698 transitions. [2022-10-15 21:34:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-10-15 21:34:06,157 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:06,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:06,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 21:34:06,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:34:06,371 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1991231195, now seen corresponding path program 1 times [2022-10-15 21:34:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:06,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798719202] [2022-10-15 21:34:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:06,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:06,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:06,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:06,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:34:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:06,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:34:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:06,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:34:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:06,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:34:06,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:06,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798719202] [2022-10-15 21:34:06,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798719202] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:06,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:06,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:34:06,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453989150] [2022-10-15 21:34:06,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:06,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:34:06,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:06,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:34:06,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:06,684 INFO L87 Difference]: Start difference. First operand 537 states and 698 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 21:34:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:07,162 INFO L93 Difference]: Finished difference Result 1080 states and 1415 transitions. [2022-10-15 21:34:07,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:34:07,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2022-10-15 21:34:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:07,170 INFO L225 Difference]: With dead ends: 1080 [2022-10-15 21:34:07,170 INFO L226 Difference]: Without dead ends: 1078 [2022-10-15 21:34:07,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:34:07,172 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 238 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:07,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 682 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:34:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2022-10-15 21:34:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1041. [2022-10-15 21:34:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 818 states have (on average 1.3092909535452322) internal successors, (1071), 832 states have internal predecessors, (1071), 146 states have call successors, (146), 66 states have call predecessors, (146), 66 states have return successors, (158), 146 states have call predecessors, (158), 146 states have call successors, (158) [2022-10-15 21:34:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1375 transitions. [2022-10-15 21:34:07,276 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1375 transitions. Word has length 86 [2022-10-15 21:34:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:07,277 INFO L495 AbstractCegarLoop]: Abstraction has 1041 states and 1375 transitions. [2022-10-15 21:34:07,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 21:34:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1375 transitions. [2022-10-15 21:34:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-10-15 21:34:07,279 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:07,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:07,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:34:07,280 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:07,281 INFO L85 PathProgramCache]: Analyzing trace with hash 689868528, now seen corresponding path program 1 times [2022-10-15 21:34:07,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:07,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797438127] [2022-10-15 21:34:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:07,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:34:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:34:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:34:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:34:07,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:07,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797438127] [2022-10-15 21:34:07,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797438127] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:34:07,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295857216] [2022-10-15 21:34:07,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:07,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:34:07,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:34:07,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:34:07,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 21:34:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:07,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:34:07,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:34:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:34:07,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:34:07,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295857216] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:07,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:34:07,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-15 21:34:07,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644636058] [2022-10-15 21:34:07,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:07,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:34:07,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:07,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:34:07,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:34:07,709 INFO L87 Difference]: Start difference. First operand 1041 states and 1375 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-15 21:34:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:07,902 INFO L93 Difference]: Finished difference Result 2303 states and 3075 transitions. [2022-10-15 21:34:07,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:34:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 86 [2022-10-15 21:34:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:07,921 INFO L225 Difference]: With dead ends: 2303 [2022-10-15 21:34:07,922 INFO L226 Difference]: Without dead ends: 1282 [2022-10-15 21:34:07,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:34:07,926 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 163 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:07,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 546 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:34:07,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2022-10-15 21:34:08,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 930. [2022-10-15 21:34:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 726 states have (on average 1.2768595041322315) internal successors, (927), 737 states have internal predecessors, (927), 130 states have call successors, (130), 66 states have call predecessors, (130), 66 states have return successors, (138), 130 states have call predecessors, (138), 130 states have call successors, (138) [2022-10-15 21:34:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1195 transitions. [2022-10-15 21:34:08,030 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1195 transitions. Word has length 86 [2022-10-15 21:34:08,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:08,031 INFO L495 AbstractCegarLoop]: Abstraction has 930 states and 1195 transitions. [2022-10-15 21:34:08,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-15 21:34:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1195 transitions. [2022-10-15 21:34:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-10-15 21:34:08,033 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:08,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:08,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 21:34:08,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-10-15 21:34:08,248 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:08,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:08,249 INFO L85 PathProgramCache]: Analyzing trace with hash 307828507, now seen corresponding path program 1 times [2022-10-15 21:34:08,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:08,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263002931] [2022-10-15 21:34:08,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:08,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:08,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:34:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:08,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:08,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:08,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:34:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:08,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:34:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:08,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:08,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:34:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-10-15 21:34:08,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:08,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263002931] [2022-10-15 21:34:08,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263002931] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:34:08,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888725866] [2022-10-15 21:34:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:08,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:34:08,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:34:08,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:34:08,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 21:34:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:08,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 21:34:08,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:34:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:34:09,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:34:09,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888725866] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:09,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:34:09,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2022-10-15 21:34:09,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727999503] [2022-10-15 21:34:09,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:09,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:34:09,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:09,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:34:09,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-10-15 21:34:09,355 INFO L87 Difference]: Start difference. First operand 930 states and 1195 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-10-15 21:34:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:09,656 INFO L93 Difference]: Finished difference Result 946 states and 1203 transitions. [2022-10-15 21:34:09,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:34:09,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 100 [2022-10-15 21:34:09,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:09,660 INFO L225 Difference]: With dead ends: 946 [2022-10-15 21:34:09,660 INFO L226 Difference]: Without dead ends: 472 [2022-10-15 21:34:09,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-10-15 21:34:09,663 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 178 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:09,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 338 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:34:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-10-15 21:34:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2022-10-15 21:34:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 368 states have (on average 1.2717391304347827) internal successors, (468), 375 states have internal predecessors, (468), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-10-15 21:34:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 598 transitions. [2022-10-15 21:34:09,710 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 598 transitions. Word has length 100 [2022-10-15 21:34:09,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:09,711 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 598 transitions. [2022-10-15 21:34:09,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-10-15 21:34:09,711 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 598 transitions. [2022-10-15 21:34:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-10-15 21:34:09,713 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:09,713 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:09,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-15 21:34:09,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:34:09,928 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2092783693, now seen corresponding path program 1 times [2022-10-15 21:34:09,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:09,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025967288] [2022-10-15 21:34:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:34:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:34:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 21:34:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:34:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-15 21:34:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-15 21:34:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-15 21:34:10,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:10,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025967288] [2022-10-15 21:34:10,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025967288] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:10,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:10,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:34:10,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334786303] [2022-10-15 21:34:10,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:10,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:34:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:10,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:34:10,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:10,130 INFO L87 Difference]: Start difference. First operand 472 states and 598 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:34:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:10,448 INFO L93 Difference]: Finished difference Result 766 states and 971 transitions. [2022-10-15 21:34:10,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:34:10,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2022-10-15 21:34:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:10,453 INFO L225 Difference]: With dead ends: 766 [2022-10-15 21:34:10,453 INFO L226 Difference]: Without dead ends: 490 [2022-10-15 21:34:10,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:10,455 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 37 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:10,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 610 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 21:34:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-10-15 21:34:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 476. [2022-10-15 21:34:10,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 371 states have (on average 1.2695417789757413) internal successors, (471), 378 states have internal predecessors, (471), 66 states have call successors, (66), 33 states have call predecessors, (66), 33 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-10-15 21:34:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 603 transitions. [2022-10-15 21:34:10,504 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 603 transitions. Word has length 105 [2022-10-15 21:34:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:10,505 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 603 transitions. [2022-10-15 21:34:10,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:34:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 603 transitions. [2022-10-15 21:34:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-10-15 21:34:10,508 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:10,508 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:10,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 21:34:10,509 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:10,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:10,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1741438787, now seen corresponding path program 1 times [2022-10-15 21:34:10,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:10,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826434933] [2022-10-15 21:34:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:10,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:34:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:34:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 21:34:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:34:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-15 21:34:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-15 21:34:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-15 21:34:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-15 21:34:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-10-15 21:34:10,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:10,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826434933] [2022-10-15 21:34:10,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826434933] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:34:10,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176414201] [2022-10-15 21:34:10,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:10,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:34:10,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:34:10,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:34:10,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 21:34:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:10,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:34:10,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:34:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-10-15 21:34:11,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:34:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-10-15 21:34:11,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176414201] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:34:11,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:34:11,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-10-15 21:34:11,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278181531] [2022-10-15 21:34:11,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:34:11,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 21:34:11,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:11,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 21:34:11,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:34:11,089 INFO L87 Difference]: Start difference. First operand 476 states and 603 transitions. Second operand has 9 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 6 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-10-15 21:34:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:11,632 INFO L93 Difference]: Finished difference Result 993 states and 1349 transitions. [2022-10-15 21:34:11,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:34:11,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 6 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 120 [2022-10-15 21:34:11,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:11,640 INFO L225 Difference]: With dead ends: 993 [2022-10-15 21:34:11,640 INFO L226 Difference]: Without dead ends: 992 [2022-10-15 21:34:11,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:34:11,642 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 532 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:11,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1544 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:34:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-10-15 21:34:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 475. [2022-10-15 21:34:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 371 states have (on average 1.266846361185984) internal successors, (470), 377 states have internal predecessors, (470), 66 states have call successors, (66), 33 states have call predecessors, (66), 33 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-10-15 21:34:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 602 transitions. [2022-10-15 21:34:11,712 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 602 transitions. Word has length 120 [2022-10-15 21:34:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:11,712 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 602 transitions. [2022-10-15 21:34:11,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 6 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-10-15 21:34:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 602 transitions. [2022-10-15 21:34:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-10-15 21:34:11,717 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:11,717 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:11,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 21:34:11,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:34:11,931 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:11,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1849972759, now seen corresponding path program 1 times [2022-10-15 21:34:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:11,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289312475] [2022-10-15 21:34:11,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:11,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:34:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:34:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 21:34:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:34:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-15 21:34:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-15 21:34:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-15 21:34:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-15 21:34:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-10-15 21:34:12,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:12,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289312475] [2022-10-15 21:34:12,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289312475] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:34:12,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213541146] [2022-10-15 21:34:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:12,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:34:12,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:34:12,231 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:34:12,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 21:34:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:12,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:34:12,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:34:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-10-15 21:34:12,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:34:12,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213541146] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:12,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:34:12,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-15 21:34:12,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333490935] [2022-10-15 21:34:12,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:12,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:34:12,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:12,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:34:12,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:34:12,499 INFO L87 Difference]: Start difference. First operand 475 states and 602 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:34:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:12,609 INFO L93 Difference]: Finished difference Result 635 states and 830 transitions. [2022-10-15 21:34:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:34:12,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 121 [2022-10-15 21:34:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:12,614 INFO L225 Difference]: With dead ends: 635 [2022-10-15 21:34:12,614 INFO L226 Difference]: Without dead ends: 634 [2022-10-15 21:34:12,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:34:12,615 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 228 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:12,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 585 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:34:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-10-15 21:34:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 471. [2022-10-15 21:34:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 369 states have (on average 1.2655826558265582) internal successors, (467), 374 states have internal predecessors, (467), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-10-15 21:34:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 597 transitions. [2022-10-15 21:34:12,671 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 597 transitions. Word has length 121 [2022-10-15 21:34:12,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:12,672 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 597 transitions. [2022-10-15 21:34:12,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:34:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 597 transitions. [2022-10-15 21:34:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-10-15 21:34:12,675 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:12,675 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:12,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 21:34:12,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-15 21:34:12,889 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:12,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2042279258, now seen corresponding path program 1 times [2022-10-15 21:34:12,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:12,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092203408] [2022-10-15 21:34:12,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:12,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:34:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:34:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 21:34:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-15 21:34:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-15 21:34:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-10-15 21:34:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-15 21:34:13,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:13,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092203408] [2022-10-15 21:34:13,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092203408] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:13,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:13,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:34:13,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023088430] [2022-10-15 21:34:13,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:13,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:34:13,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:13,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:34:13,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:13,105 INFO L87 Difference]: Start difference. First operand 471 states and 597 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-10-15 21:34:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:13,448 INFO L93 Difference]: Finished difference Result 743 states and 937 transitions. [2022-10-15 21:34:13,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:34:13,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 114 [2022-10-15 21:34:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:13,453 INFO L225 Difference]: With dead ends: 743 [2022-10-15 21:34:13,453 INFO L226 Difference]: Without dead ends: 468 [2022-10-15 21:34:13,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:34:13,456 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 119 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:13,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 686 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 21:34:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-10-15 21:34:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 454. [2022-10-15 21:34:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 352 states have (on average 1.25) internal successors, (440), 357 states have internal predecessors, (440), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-10-15 21:34:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 570 transitions. [2022-10-15 21:34:13,509 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 570 transitions. Word has length 114 [2022-10-15 21:34:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:13,509 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 570 transitions. [2022-10-15 21:34:13,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-10-15 21:34:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 570 transitions. [2022-10-15 21:34:13,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-10-15 21:34:13,512 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:13,512 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:13,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 21:34:13,512 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:13,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:13,513 INFO L85 PathProgramCache]: Analyzing trace with hash -219510499, now seen corresponding path program 1 times [2022-10-15 21:34:13,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:13,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600776345] [2022-10-15 21:34:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:13,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:34:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:34:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 21:34:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:34:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-15 21:34:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-15 21:34:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-15 21:34:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-10-15 21:34:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 21:34:13,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:13,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600776345] [2022-10-15 21:34:13,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600776345] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:34:13,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874589111] [2022-10-15 21:34:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:13,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:34:13,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:34:13,788 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:34:13,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 21:34:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:14,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:34:14,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:34:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-15 21:34:14,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:34:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 21:34:14,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874589111] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:34:14,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:34:14,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-10-15 21:34:14,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466725485] [2022-10-15 21:34:14,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:34:14,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 21:34:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:14,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 21:34:14,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:34:14,294 INFO L87 Difference]: Start difference. First operand 454 states and 570 transitions. Second operand has 9 states, 8 states have (on average 25.5) internal successors, (204), 7 states have internal predecessors, (204), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2022-10-15 21:34:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:15,617 INFO L93 Difference]: Finished difference Result 1177 states and 1480 transitions. [2022-10-15 21:34:15,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 21:34:15,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 25.5) internal successors, (204), 7 states have internal predecessors, (204), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) Word has length 119 [2022-10-15 21:34:15,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:15,626 INFO L225 Difference]: With dead ends: 1177 [2022-10-15 21:34:15,626 INFO L226 Difference]: Without dead ends: 1175 [2022-10-15 21:34:15,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:34:15,628 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 1639 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 624 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:15,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1734 Valid, 956 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [624 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-15 21:34:15,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2022-10-15 21:34:15,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 882. [2022-10-15 21:34:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 683 states have (on average 1.2430453879941434) internal successors, (849), 689 states have internal predecessors, (849), 130 states have call successors, (130), 66 states have call predecessors, (130), 66 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2022-10-15 21:34:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1109 transitions. [2022-10-15 21:34:15,737 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1109 transitions. Word has length 119 [2022-10-15 21:34:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:15,737 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 1109 transitions. [2022-10-15 21:34:15,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 25.5) internal successors, (204), 7 states have internal predecessors, (204), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2022-10-15 21:34:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1109 transitions. [2022-10-15 21:34:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-10-15 21:34:15,740 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:15,741 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:15,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 21:34:15,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 21:34:15,955 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:15,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:15,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1785109447, now seen corresponding path program 1 times [2022-10-15 21:34:15,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:15,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685661789] [2022-10-15 21:34:15,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:15,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:34:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:34:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 21:34:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:34:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-15 21:34:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-15 21:34:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-15 21:34:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-10-15 21:34:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 21:34:16,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:16,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685661789] [2022-10-15 21:34:16,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685661789] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:34:16,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222341146] [2022-10-15 21:34:16,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:16,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:34:16,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:34:16,220 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:34:16,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 21:34:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:16,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:34:16,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:34:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-15 21:34:16,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:34:16,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222341146] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:16,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:34:16,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-15 21:34:16,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822174078] [2022-10-15 21:34:16,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:16,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:34:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:16,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:34:16,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:34:16,585 INFO L87 Difference]: Start difference. First operand 882 states and 1109 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-15 21:34:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:16,843 INFO L93 Difference]: Finished difference Result 1058 states and 1335 transitions. [2022-10-15 21:34:16,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:34:16,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2022-10-15 21:34:16,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:16,851 INFO L225 Difference]: With dead ends: 1058 [2022-10-15 21:34:16,851 INFO L226 Difference]: Without dead ends: 1056 [2022-10-15 21:34:16,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:34:16,853 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 320 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:16,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 529 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:34:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-10-15 21:34:16,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 704. [2022-10-15 21:34:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 546 states have (on average 1.2362637362637363) internal successors, (675), 549 states have internal predecessors, (675), 103 states have call successors, (103), 54 states have call predecessors, (103), 54 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2022-10-15 21:34:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 881 transitions. [2022-10-15 21:34:16,956 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 881 transitions. Word has length 120 [2022-10-15 21:34:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:16,957 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 881 transitions. [2022-10-15 21:34:16,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-15 21:34:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 881 transitions. [2022-10-15 21:34:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-10-15 21:34:16,962 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:16,962 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-10-15 21:34:16,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 21:34:17,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:34:17,176 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-10-15 21:34:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1114179813, now seen corresponding path program 2 times [2022-10-15 21:34:17,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:17,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335827480] [2022-10-15 21:34:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:17,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:34:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:34:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:34:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:34:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:34:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-15 21:34:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-15 21:34:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-10-15 21:34:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-15 21:34:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 21:34:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-10-15 21:34:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-10-15 21:34:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-10-15 21:34:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-10-15 21:34:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-10-15 21:34:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-10-15 21:34:17,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:17,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335827480] [2022-10-15 21:34:17,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335827480] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:17,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:17,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:34:17,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263085315] [2022-10-15 21:34:17,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:17,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:34:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:17,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:34:17,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:17,480 INFO L87 Difference]: Start difference. First operand 704 states and 881 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-15 21:34:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:17,838 INFO L93 Difference]: Finished difference Result 961 states and 1199 transitions. [2022-10-15 21:34:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:34:17,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 197 [2022-10-15 21:34:17,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:17,839 INFO L225 Difference]: With dead ends: 961 [2022-10-15 21:34:17,840 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 21:34:17,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:34:17,844 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 189 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:17,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 509 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 21:34:17,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 21:34:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 21:34:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:34:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 21:34:17,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 197 [2022-10-15 21:34:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:17,847 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 21:34:17,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-15 21:34:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 21:34:17,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 21:34:17,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-10-15 21:34:17,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-10-15 21:34:17,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-10-15 21:34:17,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-10-15 21:34:17,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-10-15 21:34:17,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-10-15 21:34:17,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-10-15 21:34:17,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-10-15 21:34:17,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-10-15 21:34:17,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-10-15 21:34:17,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-10-15 21:34:17,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-10-15 21:34:17,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-10-15 21:34:17,857 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-10-15 21:34:17,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 21:34:17,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 21:34:23,048 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_rawENTRY(lines 938 943) the Hoare annotation is: true [2022-10-15 21:34:23,049 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawFINAL(lines 938 943) no Hoare annotation was computed. [2022-10-15 21:34:23,049 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawEXIT(lines 938 943) no Hoare annotation was computed. [2022-10-15 21:34:23,051 INFO L895 garLoopResultBuilder]: At program point platform_get_drvdataENTRY(lines 893 900) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (not (<= ~ldv_count_1~0 0))) [2022-10-15 21:34:23,052 INFO L895 garLoopResultBuilder]: At program point L1407(line 1407) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (not (<= ~ldv_count_1~0 0))) [2022-10-15 21:34:23,053 INFO L899 garLoopResultBuilder]: For program point L1407-1(line 1407) no Hoare annotation was computed. [2022-10-15 21:34:23,054 INFO L902 garLoopResultBuilder]: At program point L1407-2(lines 1406 1408) the Hoare annotation is: true [2022-10-15 21:34:23,054 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataEXIT(lines 893 900) no Hoare annotation was computed. [2022-10-15 21:34:23,054 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataFINAL(lines 893 900) no Hoare annotation was computed. [2022-10-15 21:34:23,055 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeFINAL(lines 1376 1392) no Hoare annotation was computed. [2022-10-15 21:34:23,055 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1381) no Hoare annotation was computed. [2022-10-15 21:34:23,056 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1381) no Hoare annotation was computed. [2022-10-15 21:34:23,056 INFO L895 garLoopResultBuilder]: At program point L845(lines 840 847) the Hoare annotation is: (or (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_state_variable_1~0 1)) (not (= ~ldv_state_variable_0~0 3)) (= ~ldv_count_2~0 0) (not (<= ~ldv_count_1~0 0))) [2022-10-15 21:34:23,057 INFO L902 garLoopResultBuilder]: At program point L1385(line 1385) the Hoare annotation is: true [2022-10-15 21:34:23,057 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_file_dev_attr_of_sensor_device_attributeENTRY(lines 1376 1392) the Hoare annotation is: (or (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_state_variable_1~0 1)) (not (= ~ldv_state_variable_0~0 3)) (= ~ldv_count_2~0 0) (not (<= ~ldv_count_1~0 0))) [2022-10-15 21:34:23,057 INFO L899 garLoopResultBuilder]: For program point L1383(lines 1383 1386) no Hoare annotation was computed. [2022-10-15 21:34:23,057 INFO L899 garLoopResultBuilder]: For program point L1381(line 1381) no Hoare annotation was computed. [2022-10-15 21:34:23,057 INFO L899 garLoopResultBuilder]: For program point L1380(lines 1380 1388) no Hoare annotation was computed. [2022-10-15 21:34:23,057 INFO L899 garLoopResultBuilder]: For program point L1381-1(line 1381) no Hoare annotation was computed. [2022-10-15 21:34:23,057 INFO L899 garLoopResultBuilder]: For program point L1380-1(lines 1380 1388) no Hoare annotation was computed. [2022-10-15 21:34:23,057 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeEXIT(lines 1376 1392) no Hoare annotation was computed. [2022-10-15 21:34:23,058 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 1426 1428) no Hoare annotation was computed. [2022-10-15 21:34:23,058 INFO L902 garLoopResultBuilder]: At program point hwmon_device_unregisterENTRY(lines 1426 1428) the Hoare annotation is: true [2022-10-15 21:34:23,058 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 1426 1428) no Hoare annotation was computed. [2022-10-15 21:34:23,059 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 856 862) no Hoare annotation was computed. [2022-10-15 21:34:23,059 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 856 862) the Hoare annotation is: true [2022-10-15 21:34:23,059 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 856 862) no Hoare annotation was computed. [2022-10-15 21:34:23,061 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 863 869) no Hoare annotation was computed. [2022-10-15 21:34:23,062 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 863 869) the Hoare annotation is: true [2022-10-15 21:34:23,062 INFO L902 garLoopResultBuilder]: At program point s3c_adc_releaseENTRY(lines 1453 1455) the Hoare annotation is: true [2022-10-15 21:34:23,062 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseEXIT(lines 1453 1455) no Hoare annotation was computed. [2022-10-15 21:34:23,062 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseFINAL(lines 1453 1455) no Hoare annotation was computed. [2022-10-15 21:34:23,062 INFO L899 garLoopResultBuilder]: For program point L801(line 801) no Hoare annotation was computed. [2022-10-15 21:34:23,062 INFO L899 garLoopResultBuilder]: For program point L801-2(lines 800 802) no Hoare annotation was computed. [2022-10-15 21:34:23,063 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 800 802) the Hoare annotation is: true [2022-10-15 21:34:23,064 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 800 802) no Hoare annotation was computed. [2022-10-15 21:34:23,065 INFO L902 garLoopResultBuilder]: At program point L1345(lines 1342 1347) the Hoare annotation is: true [2022-10-15 21:34:23,066 INFO L899 garLoopResultBuilder]: For program point PTR_ERREXIT(lines 1290 1297) no Hoare annotation was computed. [2022-10-15 21:34:23,070 INFO L902 garLoopResultBuilder]: At program point PTR_ERRENTRY(lines 1290 1297) the Hoare annotation is: true [2022-10-15 21:34:23,070 INFO L899 garLoopResultBuilder]: For program point PTR_ERRFINAL(lines 1290 1297) no Hoare annotation was computed. [2022-10-15 21:34:23,070 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 1330 1335) no Hoare annotation was computed. [2022-10-15 21:34:23,071 INFO L902 garLoopResultBuilder]: At program point ldv_is_errENTRY(lines 1330 1335) the Hoare annotation is: true [2022-10-15 21:34:23,071 INFO L899 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 1330 1335) no Hoare annotation was computed. [2022-10-15 21:34:23,071 INFO L899 garLoopResultBuilder]: For program point L817(line 817) no Hoare annotation was computed. [2022-10-15 21:34:23,071 INFO L902 garLoopResultBuilder]: At program point L816(line 816) the Hoare annotation is: true [2022-10-15 21:34:23,071 INFO L902 garLoopResultBuilder]: At program point L817-1(line 817) the Hoare annotation is: true [2022-10-15 21:34:23,072 INFO L902 garLoopResultBuilder]: At program point L816-1(line 816) the Hoare annotation is: true [2022-10-15 21:34:23,072 INFO L899 garLoopResultBuilder]: For program point L817-2(line 817) no Hoare annotation was computed. [2022-10-15 21:34:23,076 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 804 821) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_count_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (= ~ldv_state_variable_0~0 3))) (.cse3 (not (<= ~ldv_count_1~0 0)))) (and (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse0 .cse1 .cse2 (not (<= ~ref_cnt~0 1)) .cse3) (or (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_state_variable_1~0 1)) .cse0 .cse1 .cse2 (not (<= ~ref_cnt~0 0)) .cse3))) [2022-10-15 21:34:23,077 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 819) no Hoare annotation was computed. [2022-10-15 21:34:23,077 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 804 821) no Hoare annotation was computed. [2022-10-15 21:34:23,077 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 804 821) no Hoare annotation was computed. [2022-10-15 21:34:23,077 INFO L902 garLoopResultBuilder]: At program point L834-1(line 834) the Hoare annotation is: true [2022-10-15 21:34:23,077 INFO L899 garLoopResultBuilder]: For program point L835-2(line 835) no Hoare annotation was computed. [2022-10-15 21:34:23,077 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 21:34:23,077 INFO L899 garLoopResultBuilder]: For program point L829(lines 829 837) no Hoare annotation was computed. [2022-10-15 21:34:23,078 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 822 839) no Hoare annotation was computed. [2022-10-15 21:34:23,078 INFO L895 garLoopResultBuilder]: At program point ldv_zallocENTRY(lines 822 839) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_state_variable_1~0 1)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-10-15 21:34:23,078 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 822 839) no Hoare annotation was computed. [2022-10-15 21:34:23,078 INFO L899 garLoopResultBuilder]: For program point L835(line 835) no Hoare annotation was computed. [2022-10-15 21:34:23,078 INFO L902 garLoopResultBuilder]: At program point L834(line 834) the Hoare annotation is: true [2022-10-15 21:34:23,078 INFO L902 garLoopResultBuilder]: At program point L835-1(line 835) the Hoare annotation is: true [2022-10-15 21:34:23,078 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 1420 1422) no Hoare annotation was computed. [2022-10-15 21:34:23,081 INFO L902 garLoopResultBuilder]: At program point device_remove_fileENTRY(lines 1420 1422) the Hoare annotation is: true [2022-10-15 21:34:23,082 INFO L899 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 1420 1422) no Hoare annotation was computed. [2022-10-15 21:34:23,082 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-10-15 21:34:23,082 INFO L902 garLoopResultBuilder]: At program point L1274(line 1274) the Hoare annotation is: true [2022-10-15 21:34:23,082 INFO L899 garLoopResultBuilder]: For program point L1159(line 1159) no Hoare annotation was computed. [2022-10-15 21:34:23,082 INFO L895 garLoopResultBuilder]: At program point L1027(lines 994 1029) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-10-15 21:34:23,083 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 21:34:23,083 INFO L895 garLoopResultBuilder]: At program point L1143(lines 1038 1145) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,083 INFO L899 garLoopResultBuilder]: For program point L1457(lines 1457 1459) no Hoare annotation was computed. [2022-10-15 21:34:23,083 INFO L895 garLoopResultBuilder]: At program point L1424(line 1424) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,083 INFO L899 garLoopResultBuilder]: For program point L1424-1(line 1424) no Hoare annotation was computed. [2022-10-15 21:34:23,083 INFO L895 garLoopResultBuilder]: At program point L1424-2(lines 1423 1425) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,083 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 1264) no Hoare annotation was computed. [2022-10-15 21:34:23,084 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1159) no Hoare annotation was computed. [2022-10-15 21:34:23,084 INFO L899 garLoopResultBuilder]: For program point L1259-2(lines 1257 1270) no Hoare annotation was computed. [2022-10-15 21:34:23,084 INFO L895 garLoopResultBuilder]: At program point L1160(lines 1151 1168) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 2)) (.cse2 (<= 1 ~ref_cnt~0)) (.cse3 (= ~ldv_count_2~0 0)) (.cse4 (= ~ldv_state_variable_0~0 3)) (.cse5 (<= ~ref_cnt~0 1))) (or (and .cse0 (= |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (<= |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 2147483646) (<= 1 |ULTIMATE.start_s3c_hwmon_remove_~i~1#1|) .cse2 .cse3 .cse4 .cse5))) [2022-10-15 21:34:23,085 INFO L895 garLoopResultBuilder]: At program point L1127(lines 1051 1144) the Hoare annotation is: (and (let ((.cse0 (= ~ldv_state_variable_1~0 1)) (.cse1 (= ~ldv_count_2~0 0))) (or (and (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1) (and .cse0 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse1))) (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,085 INFO L899 garLoopResultBuilder]: For program point L1061(lines 1061 1065) no Hoare annotation was computed. [2022-10-15 21:34:23,085 INFO L895 garLoopResultBuilder]: At program point L1441(lines 1440 1442) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-10-15 21:34:23,085 INFO L899 garLoopResultBuilder]: For program point L1111(lines 1111 1126) no Hoare annotation was computed. [2022-10-15 21:34:23,085 INFO L899 garLoopResultBuilder]: For program point L1078(lines 1078 1081) no Hoare annotation was computed. [2022-10-15 21:34:23,085 INFO L899 garLoopResultBuilder]: For program point L1012(lines 1012 1026) no Hoare annotation was computed. [2022-10-15 21:34:23,086 INFO L899 garLoopResultBuilder]: For program point L1012-1(lines 1012 1026) no Hoare annotation was computed. [2022-10-15 21:34:23,086 INFO L895 garLoopResultBuilder]: At program point L1326(line 1326) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,086 INFO L899 garLoopResultBuilder]: For program point L1326-1(line 1326) no Hoare annotation was computed. [2022-10-15 21:34:23,087 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1159) no Hoare annotation was computed. [2022-10-15 21:34:23,087 INFO L899 garLoopResultBuilder]: For program point L1128(line 1128) no Hoare annotation was computed. [2022-10-15 21:34:23,087 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1095 1098) no Hoare annotation was computed. [2022-10-15 21:34:23,087 INFO L895 garLoopResultBuilder]: At program point L1310(line 1310) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-10-15 21:34:23,087 INFO L899 garLoopResultBuilder]: For program point L1310-1(line 1310) no Hoare annotation was computed. [2022-10-15 21:34:23,087 INFO L899 garLoopResultBuilder]: For program point L1244(line 1244) no Hoare annotation was computed. [2022-10-15 21:34:23,088 INFO L895 garLoopResultBuilder]: At program point L1178(lines 1173 1180) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-10-15 21:34:23,088 INFO L895 garLoopResultBuilder]: At program point L1327(lines 1322 1329) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,088 INFO L895 garLoopResultBuilder]: At program point L1162(lines 1151 1168) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_count_2~0 0))) (or (and .cse0 (< |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 2147483646) (<= 1 |ULTIMATE.start_s3c_hwmon_remove_~i~1#1|) .cse1) (and .cse0 (= |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 0) .cse1))) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:34:23,088 INFO L895 garLoopResultBuilder]: At program point L1129(lines 1051 1144) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (<= ~ref_cnt~0 0)) (.cse2 (<= 0 ~ref_cnt~0)) (.cse3 (= ~ldv_state_variable_1~0 1)) (.cse4 (= ~ldv_count_2~0 0)) (.cse5 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse3 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) .cse4 .cse5))) [2022-10-15 21:34:23,088 INFO L895 garLoopResultBuilder]: At program point L1311(lines 1306 1313) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-10-15 21:34:23,088 INFO L899 garLoopResultBuilder]: For program point L1245(lines 1245 1278) no Hoare annotation was computed. [2022-10-15 21:34:23,089 INFO L899 garLoopResultBuilder]: For program point L1229(line 1229) no Hoare annotation was computed. [2022-10-15 21:34:23,089 INFO L895 garLoopResultBuilder]: At program point L1196(line 1196) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,090 INFO L899 garLoopResultBuilder]: For program point L1196-1(line 1196) no Hoare annotation was computed. [2022-10-15 21:34:23,090 INFO L902 garLoopResultBuilder]: At program point L1444(lines 1443 1445) the Hoare annotation is: true [2022-10-15 21:34:23,090 INFO L899 garLoopResultBuilder]: For program point L1213(lines 1213 1282) no Hoare annotation was computed. [2022-10-15 21:34:23,090 INFO L899 garLoopResultBuilder]: For program point L1114(line 1114) no Hoare annotation was computed. [2022-10-15 21:34:23,090 INFO L899 garLoopResultBuilder]: For program point L1114-1(line 1114) no Hoare annotation was computed. [2022-10-15 21:34:23,090 INFO L899 garLoopResultBuilder]: For program point L1230(lines 1230 1235) no Hoare annotation was computed. [2022-10-15 21:34:23,090 INFO L895 garLoopResultBuilder]: At program point L1131(lines 1051 1144) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-10-15 21:34:23,090 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 21:34:23,091 INFO L899 garLoopResultBuilder]: For program point L1280(line 1280) no Hoare annotation was computed. [2022-10-15 21:34:23,091 INFO L899 garLoopResultBuilder]: For program point L1247(lines 1247 1275) no Hoare annotation was computed. [2022-10-15 21:34:23,091 INFO L899 garLoopResultBuilder]: For program point L1214(line 1214) no Hoare annotation was computed. [2022-10-15 21:34:23,091 INFO L895 garLoopResultBuilder]: At program point L1396(lines 1393 1398) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-10-15 21:34:23,091 INFO L895 garLoopResultBuilder]: At program point L1198(lines 1192 1200) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,091 INFO L895 garLoopResultBuilder]: At program point L1165(line 1165) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (<= |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 2147483646) (<= 1 |ULTIMATE.start_s3c_hwmon_remove_~i~1#1|) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:34:23,091 INFO L899 garLoopResultBuilder]: For program point L1165-1(line 1165) no Hoare annotation was computed. [2022-10-15 21:34:23,092 INFO L899 garLoopResultBuilder]: For program point L1099(lines 1099 1103) no Hoare annotation was computed. [2022-10-15 21:34:23,092 INFO L899 garLoopResultBuilder]: For program point L1099-2(lines 1099 1103) no Hoare annotation was computed. [2022-10-15 21:34:23,092 INFO L902 garLoopResultBuilder]: At program point L1281(line 1281) the Hoare annotation is: true [2022-10-15 21:34:23,092 INFO L899 garLoopResultBuilder]: For program point L1248(line 1248) no Hoare annotation was computed. [2022-10-15 21:34:23,092 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1242) no Hoare annotation was computed. [2022-10-15 21:34:23,092 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-10-15 21:34:23,092 INFO L895 garLoopResultBuilder]: At program point L1083(line 1083) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,093 INFO L899 garLoopResultBuilder]: For program point L1083-1(line 1083) no Hoare annotation was computed. [2022-10-15 21:34:23,094 INFO L902 garLoopResultBuilder]: At program point L1430(lines 1429 1431) the Hoare annotation is: true [2022-10-15 21:34:23,095 INFO L895 garLoopResultBuilder]: At program point L1166(line 1166) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (<= |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 2147483646) (<= 1 |ULTIMATE.start_s3c_hwmon_remove_~i~1#1|) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:34:23,095 INFO L899 garLoopResultBuilder]: For program point L1166-1(line 1166) no Hoare annotation was computed. [2022-10-15 21:34:23,095 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1223) no Hoare annotation was computed. [2022-10-15 21:34:23,095 INFO L895 garLoopResultBuilder]: At program point L935(lines 932 937) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,095 INFO L895 garLoopResultBuilder]: At program point L1414(lines 1413 1415) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,095 INFO L899 garLoopResultBuilder]: For program point L1249(lines 1249 1254) no Hoare annotation was computed. [2022-10-15 21:34:23,095 INFO L899 garLoopResultBuilder]: For program point L1117(line 1117) no Hoare annotation was computed. [2022-10-15 21:34:23,096 INFO L899 garLoopResultBuilder]: For program point L1084(lines 1084 1090) no Hoare annotation was computed. [2022-10-15 21:34:23,096 INFO L899 garLoopResultBuilder]: For program point L1233(line 1233) no Hoare annotation was computed. [2022-10-15 21:34:23,096 INFO L899 garLoopResultBuilder]: For program point L1233-1(line 1233) no Hoare annotation was computed. [2022-10-15 21:34:23,096 INFO L895 garLoopResultBuilder]: At program point L1167(lines 1146 1169) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (<= |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 2147483646) (<= 1 |ULTIMATE.start_s3c_hwmon_remove_~i~1#1|) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:34:23,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1223) no Hoare annotation was computed. [2022-10-15 21:34:23,096 INFO L895 garLoopResultBuilder]: At program point L1283(lines 1206 1288) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 0)) (.cse0 (<= ~ldv_count_1~0 0)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= ~ldv_state_variable_1~0 0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_1~0 1) .cse1 .cse2 .cse3) (and .cse0 (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse2 .cse3 (<= ~ref_cnt~0 1)))) [2022-10-15 21:34:23,097 INFO L899 garLoopResultBuilder]: For program point L1217(lines 1217 1239) no Hoare annotation was computed. [2022-10-15 21:34:23,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1114) no Hoare annotation was computed. [2022-10-15 21:34:23,097 INFO L899 garLoopResultBuilder]: For program point L1118(line 1118) no Hoare annotation was computed. [2022-10-15 21:34:23,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 21:34:23,097 INFO L902 garLoopResultBuilder]: At program point L1267(lines 1206 1288) the Hoare annotation is: true [2022-10-15 21:34:23,097 INFO L895 garLoopResultBuilder]: At program point L1069(line 1069) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,097 INFO L899 garLoopResultBuilder]: For program point L1069-1(line 1069) no Hoare annotation was computed. [2022-10-15 21:34:23,098 INFO L899 garLoopResultBuilder]: For program point L1218(line 1218) no Hoare annotation was computed. [2022-10-15 21:34:23,098 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1114) no Hoare annotation was computed. [2022-10-15 21:34:23,098 INFO L902 garLoopResultBuilder]: At program point L1185(lines 1181 1187) the Hoare annotation is: true [2022-10-15 21:34:23,098 INFO L895 garLoopResultBuilder]: At program point L1152(line 1152) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:34:23,098 INFO L895 garLoopResultBuilder]: At program point L1119(lines 1111 1125) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,098 INFO L899 garLoopResultBuilder]: For program point L1152-1(line 1152) no Hoare annotation was computed. [2022-10-15 21:34:23,098 INFO L895 garLoopResultBuilder]: At program point L1086(line 1086) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,099 INFO L899 garLoopResultBuilder]: For program point L1086-1(line 1086) no Hoare annotation was computed. [2022-10-15 21:34:23,099 INFO L899 garLoopResultBuilder]: For program point L1020(lines 1020 1024) no Hoare annotation was computed. [2022-10-15 21:34:23,099 INFO L895 garLoopResultBuilder]: At program point L1400(lines 1399 1401) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,099 INFO L895 garLoopResultBuilder]: At program point L1136(line 1136) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0)) [2022-10-15 21:34:23,099 INFO L899 garLoopResultBuilder]: For program point L1136-1(line 1136) no Hoare annotation was computed. [2022-10-15 21:34:23,099 INFO L899 garLoopResultBuilder]: For program point L1070(lines 1070 1076) no Hoare annotation was computed. [2022-10-15 21:34:23,099 INFO L895 garLoopResultBuilder]: At program point L905(lines 901 907) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,100 INFO L895 garLoopResultBuilder]: At program point L1318(line 1318) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-10-15 21:34:23,100 INFO L899 garLoopResultBuilder]: For program point L1318-1(line 1318) no Hoare annotation was computed. [2022-10-15 21:34:23,100 INFO L899 garLoopResultBuilder]: For program point L1219(lines 1219 1227) no Hoare annotation was computed. [2022-10-15 21:34:23,100 INFO L899 garLoopResultBuilder]: For program point L1054(lines 1054 1058) no Hoare annotation was computed. [2022-10-15 21:34:23,100 INFO L895 garLoopResultBuilder]: At program point L1021(line 1021) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-10-15 21:34:23,100 INFO L899 garLoopResultBuilder]: For program point L1021-1(line 1021) no Hoare annotation was computed. [2022-10-15 21:34:23,100 INFO L895 garLoopResultBuilder]: At program point L1137(lines 1051 1144) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,101 INFO L899 garLoopResultBuilder]: For program point L1104(lines 1104 1108) no Hoare annotation was computed. [2022-10-15 21:34:23,101 INFO L895 garLoopResultBuilder]: At program point L1451(line 1451) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,101 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1233) no Hoare annotation was computed. [2022-10-15 21:34:23,101 INFO L899 garLoopResultBuilder]: For program point L1451-1(line 1451) no Hoare annotation was computed. [2022-10-15 21:34:23,101 INFO L895 garLoopResultBuilder]: At program point L1451-2(lines 1450 1452) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,101 INFO L895 garLoopResultBuilder]: At program point L1319(lines 1314 1321) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-10-15 21:34:23,102 INFO L895 garLoopResultBuilder]: At program point L1154(line 1154) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:34:23,103 INFO L895 garLoopResultBuilder]: At program point L1121(lines 1111 1125) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= 0 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,103 INFO L899 garLoopResultBuilder]: For program point L1154-1(line 1154) no Hoare annotation was computed. [2022-10-15 21:34:23,103 INFO L899 garLoopResultBuilder]: For program point L1237(line 1237) no Hoare annotation was computed. [2022-10-15 21:34:23,103 INFO L895 garLoopResultBuilder]: At program point L1138(lines 1051 1144) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,103 INFO L895 garLoopResultBuilder]: At program point L1072(line 1072) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,103 INFO L899 garLoopResultBuilder]: For program point L1072-1(line 1072) no Hoare annotation was computed. [2022-10-15 21:34:23,103 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1233) no Hoare annotation was computed. [2022-10-15 21:34:23,104 INFO L902 garLoopResultBuilder]: At program point L1287(lines 1201 1289) the Hoare annotation is: true [2022-10-15 21:34:23,104 INFO L899 garLoopResultBuilder]: For program point L1221(lines 1221 1225) no Hoare annotation was computed. [2022-10-15 21:34:23,104 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 21:34:23,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1128) no Hoare annotation was computed. [2022-10-15 21:34:23,104 INFO L902 garLoopResultBuilder]: At program point L1238(line 1238) the Hoare annotation is: true [2022-10-15 21:34:23,104 INFO L899 garLoopResultBuilder]: For program point L1007(lines 1007 1011) no Hoare annotation was computed. [2022-10-15 21:34:23,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1128) no Hoare annotation was computed. [2022-10-15 21:34:23,105 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,105 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2022-10-15 21:34:23,106 INFO L899 garLoopResultBuilder]: For program point L1256(line 1256) no Hoare annotation was computed. [2022-10-15 21:34:23,106 INFO L899 garLoopResultBuilder]: For program point L1223(line 1223) no Hoare annotation was computed. [2022-10-15 21:34:23,106 INFO L899 garLoopResultBuilder]: For program point L1223-1(line 1223) no Hoare annotation was computed. [2022-10-15 21:34:23,106 INFO L895 garLoopResultBuilder]: At program point L1124(lines 1051 1144) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0)) [2022-10-15 21:34:23,106 INFO L899 garLoopResultBuilder]: For program point L1273(line 1273) no Hoare annotation was computed. [2022-10-15 21:34:23,107 INFO L895 garLoopResultBuilder]: At program point L1141(lines 1051 1144) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:34:23,107 INFO L899 garLoopResultBuilder]: For program point L1257(lines 1257 1271) no Hoare annotation was computed. [2022-10-15 21:34:23,107 INFO L899 garLoopResultBuilder]: For program point L1158(line 1158) no Hoare annotation was computed. [2022-10-15 21:34:23,107 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrEXIT(lines 1030 1037) no Hoare annotation was computed. [2022-10-15 21:34:23,107 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_attrENTRY(lines 1030 1037) the Hoare annotation is: true [2022-10-15 21:34:23,107 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrFINAL(lines 1030 1037) no Hoare annotation was computed. [2022-10-15 21:34:23,107 INFO L902 garLoopResultBuilder]: At program point L1033(line 1033) the Hoare annotation is: true [2022-10-15 21:34:23,107 INFO L902 garLoopResultBuilder]: At program point L1033-1(line 1033) the Hoare annotation is: true [2022-10-15 21:34:23,108 INFO L902 garLoopResultBuilder]: At program point IS_ERRENTRY(lines 1298 1305) the Hoare annotation is: true [2022-10-15 21:34:23,108 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 1298 1305) no Hoare annotation was computed. [2022-10-15 21:34:23,108 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 1298 1305) no Hoare annotation was computed. [2022-10-15 21:34:23,108 INFO L902 garLoopResultBuilder]: At program point L1302(line 1302) the Hoare annotation is: true [2022-10-15 21:34:23,108 INFO L899 garLoopResultBuilder]: For program point L1302-1(line 1302) no Hoare annotation was computed. [2022-10-15 21:34:23,112 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:34:23,119 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:34:23,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:34:23 BoogieIcfgContainer [2022-10-15 21:34:23,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:34:23,153 INFO L158 Benchmark]: Toolchain (without parser) took 25881.10ms. Allocated memory was 154.1MB in the beginning and 253.8MB in the end (delta: 99.6MB). Free memory was 126.9MB in the beginning and 132.6MB in the end (delta: -5.7MB). Peak memory consumption was 156.9MB. Max. memory is 8.0GB. [2022-10-15 21:34:23,153 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 154.1MB. Free memory was 124.8MB in the beginning and 124.7MB in the end (delta: 75.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:34:23,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1007.26ms. Allocated memory is still 154.1MB. Free memory was 126.6MB in the beginning and 129.2MB in the end (delta: -2.5MB). Peak memory consumption was 29.7MB. Max. memory is 8.0GB. [2022-10-15 21:34:23,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 160.58ms. Allocated memory is still 154.1MB. Free memory was 129.2MB in the beginning and 125.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-15 21:34:23,155 INFO L158 Benchmark]: Boogie Preprocessor took 129.41ms. Allocated memory is still 154.1MB. Free memory was 125.0MB in the beginning and 121.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-15 21:34:23,155 INFO L158 Benchmark]: RCFGBuilder took 1221.23ms. Allocated memory is still 154.1MB. Free memory was 121.3MB in the beginning and 77.8MB in the end (delta: 43.5MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2022-10-15 21:34:23,155 INFO L158 Benchmark]: TraceAbstraction took 23346.89ms. Allocated memory was 154.1MB in the beginning and 253.8MB in the end (delta: 99.6MB). Free memory was 77.3MB in the beginning and 132.6MB in the end (delta: -55.3MB). Peak memory consumption was 107.2MB. Max. memory is 8.0GB. [2022-10-15 21:34:23,157 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 154.1MB. Free memory was 124.8MB in the beginning and 124.7MB in the end (delta: 75.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1007.26ms. Allocated memory is still 154.1MB. Free memory was 126.6MB in the beginning and 129.2MB in the end (delta: -2.5MB). Peak memory consumption was 29.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 160.58ms. Allocated memory is still 154.1MB. Free memory was 129.2MB in the beginning and 125.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 129.41ms. Allocated memory is still 154.1MB. Free memory was 125.0MB in the beginning and 121.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1221.23ms. Allocated memory is still 154.1MB. Free memory was 121.3MB in the beginning and 77.8MB in the end (delta: 43.5MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * TraceAbstraction took 23346.89ms. Allocated memory was 154.1MB in the beginning and 253.8MB in the end (delta: 99.6MB). Free memory was 77.3MB in the beginning and 132.6MB in the end (delta: -55.3MB). Peak memory consumption was 107.2MB. Max. memory is 8.0GB. * 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: 1381]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1381]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1128]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1128]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1223]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1223]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1159]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1159]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1233]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1233]: 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 16 procedures, 208 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 23.2s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5536 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5143 mSDsluCounter, 12505 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7509 mSDsCounter, 1422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3855 IncrementalHoareTripleChecker+Invalid, 5277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1422 mSolverCounterUnsat, 4996 mSDtfsCounter, 3855 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1462 GetRequests, 1371 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1041occurred in iteration=8, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 2622 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 82 LocationsWithAnnotation, 1229 PreInvPairs, 1341 NumberOfFragments, 1386 HoareAnnotationTreeSize, 1229 FomulaSimplifications, 4903 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 82 FomulaSimplificationsInter, 12804 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2289 NumberOfCodeBlocks, 2289 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2586 ConstructedInterpolants, 0 QuantifiedInterpolants, 5049 SizeOfPredicates, 2 NumberOfNonLiveVariables, 5704 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 27 InterpolantComputations, 14 PerfectInterpolantSequences, 785/845 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 14 specifications checked. All of them hold - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: (((((ldv_count_1 <= 0 && 0 <= i) && ldv_state_variable_1 == 1) && ref_cnt == 0) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1146]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 2) && i <= 2147483646) && 1 <= i) && 1 <= ref_cnt) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 1342]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 932]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((((i == 0 && ldv_state_variable_1 == 1) && ldv_count_2 == 0) || (((ldv_state_variable_1 == 1 && 1 <= i) && i < 2147483646) && ldv_count_2 == 0)) && ldv_count_1 <= 0) && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1443]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1306]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || ((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: (((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ((((ldv_count_1 <= 0 && i < 2147483646) && 1 <= i) && ldv_count_2 == 0) || ((ldv_count_1 <= 0 && i == 0) && ldv_count_2 == 0))) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 1413]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || (((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && i <= 2147483646) && ldv_state_variable_1 == 1) && 1 <= i) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1450]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1173]: Loop Invariant Derived loop invariant: ((ldv_count_1 <= 0 && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 863]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1314]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || ((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1440]: Loop Invariant Derived loop invariant: ((ldv_count_1 <= 0 && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1429]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1406]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1181]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || ((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && i <= 0 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0) || ((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3)) || (((((ldv_count_1 <= 0 && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && ref_cnt <= 1) - InvariantResult [Line: 1322]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1192]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && i == 0) && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 2) && i <= 2147483646) && 1 <= i) && 1 <= ref_cnt) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && ref_cnt <= 1) - InvariantResult [Line: 1423]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1399]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || ((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1393]: Loop Invariant Derived loop invariant: ((ldv_count_1 <= 0 && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 840]: Loop Invariant Derived loop invariant: ((((!(ref_cnt == 0) || !(\old(ldv_count_2) == 0)) || !(ldv_state_variable_1 == 1)) || !(ldv_state_variable_0 == 3)) || ldv_count_2 == 0) || !(ldv_count_1 <= 0) RESULT: Ultimate proved your program to be correct! [2022-10-15 21:34:23,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...