./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 14cb0b0179e79f0e2d385464cbe440f1c78ee76831b4c47fbbc7c2a57322304c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:52:46,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:52:46,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:52:46,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:52:46,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:52:46,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:52:46,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:52:46,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:52:46,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:52:46,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:52:46,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:52:46,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:52:46,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:52:46,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:52:46,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:52:46,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:52:46,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:52:46,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:52:46,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:52:46,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:52:46,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:52:46,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:52:46,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:52:46,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:52:46,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:52:46,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:52:46,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:52:46,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:52:46,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:52:46,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:52:46,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:52:46,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:52:46,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:52:46,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:52:46,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:52:46,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:52:46,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:52:46,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:52:46,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:52:46,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:52:46,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:52:46,606 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-20 10:52:46,650 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:52:46,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:52:46,651 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:52:46,651 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:52:46,652 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:52:46,653 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:52:46,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:52:46,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:52:46,654 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:52:46,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:52:46,655 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:52:46,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:52:46,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:52:46,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:52:46,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:52:46,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:52:46,656 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:52:46,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:52:46,657 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:52:46,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:52:46,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:52:46,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:52:46,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:52:46,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:52:46,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:52:46,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:52:46,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:52:46,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:52:46,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:52:46,661 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:52:46,661 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:52:46,661 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:52:46,662 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14cb0b0179e79f0e2d385464cbe440f1c78ee76831b4c47fbbc7c2a57322304c [2022-11-20 10:52:46,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:52:47,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:52:47,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:52:47,012 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:52:47,012 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:52:47,014 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-11-20 10:52:50,060 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:52:50,441 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:52:50,442 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-11-20 10:52:50,455 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/data/90566de1b/98399421855c4edd86feda6ee7889190/FLAG0eac0a7d3 [2022-11-20 10:52:50,470 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/data/90566de1b/98399421855c4edd86feda6ee7889190 [2022-11-20 10:52:50,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:52:50,474 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:52:50,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:52:50,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:52:50,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:52:50,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:52:50" (1/1) ... [2022-11-20 10:52:50,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5247781c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:50, skipping insertion in model container [2022-11-20 10:52:50,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:52:50" (1/1) ... [2022-11-20 10:52:50,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:52:50,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:52:50,847 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/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-11-20 10:52:50,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:52:51,014 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:52:51,086 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/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-11-20 10:52:51,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:52:51,199 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:52:51,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:51 WrapperNode [2022-11-20 10:52:51,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:52:51,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:52:51,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:52:51,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:52:51,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:51" (1/1) ... [2022-11-20 10:52:51,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:51" (1/1) ... [2022-11-20 10:52:51,275 INFO L138 Inliner]: procedures = 78, calls = 157, calls flagged for inlining = 30, calls inlined = 26, statements flattened = 525 [2022-11-20 10:52:51,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:52:51,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:52:51,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:52:51,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:52:51,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:51" (1/1) ... [2022-11-20 10:52:51,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:51" (1/1) ... [2022-11-20 10:52:51,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:51" (1/1) ... [2022-11-20 10:52:51,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:51" (1/1) ... [2022-11-20 10:52:51,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:51" (1/1) ... [2022-11-20 10:52:51,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:51" (1/1) ... [2022-11-20 10:52:51,337 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:51" (1/1) ... [2022-11-20 10:52:51,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:51" (1/1) ... [2022-11-20 10:52:51,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:52:51,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:52:51,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:52:51,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:52:51,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:51" (1/1) ... [2022-11-20 10:52:51,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:52:51,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:51,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:52:51,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:52:51,469 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2022-11-20 10:52:51,469 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2022-11-20 10:52:51,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:52:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:52:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:52:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-20 10:52:51,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-20 10:52:51,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:52:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:52:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-11-20 10:52:51,475 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-11-20 10:52:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-20 10:52:51,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-20 10:52:51,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 10:52:51,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 10:52:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2022-11-20 10:52:51,477 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2022-11-20 10:52:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:52:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 10:52:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-11-20 10:52:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-11-20 10:52:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-11-20 10:52:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-11-20 10:52:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2022-11-20 10:52:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2022-11-20 10:52:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:52:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-20 10:52:51,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-20 10:52:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2022-11-20 10:52:51,479 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2022-11-20 10:52:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 10:52:51,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 10:52:51,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:52:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:52:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-20 10:52:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-20 10:52:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-11-20 10:52:51,484 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-11-20 10:52:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:52:51,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:52:51,485 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-11-20 10:52:51,485 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-11-20 10:52:51,787 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:52:51,795 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:52:51,940 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-20 10:52:52,520 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:52:52,549 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:52:52,550 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:52:52,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:52:52 BoogieIcfgContainer [2022-11-20 10:52:52,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:52:52,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:52:52,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:52:52,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:52:52,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:52:50" (1/3) ... [2022-11-20 10:52:52,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f545492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:52:52, skipping insertion in model container [2022-11-20 10:52:52,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:51" (2/3) ... [2022-11-20 10:52:52,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f545492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:52:52, skipping insertion in model container [2022-11-20 10:52:52,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:52:52" (3/3) ... [2022-11-20 10:52:52,579 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-11-20 10:52:52,596 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:52:52,596 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-20 10:52:52,660 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:52:52,668 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=PETRI_NET, 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;@3a3e9261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:52:52,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-20 10:52:52,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 146 states have (on average 1.36986301369863) internal successors, (200), 165 states have internal predecessors, (200), 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-11-20 10:52:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 10:52:52,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:52,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:52,685 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-11-20 10:52:52,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:52,695 INFO L85 PathProgramCache]: Analyzing trace with hash 40400747, now seen corresponding path program 1 times [2022-11-20 10:52:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:52,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754362954] [2022-11-20 10:52:52,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:52,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:53,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:53,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754362954] [2022-11-20 10:52:53,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754362954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:53,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:53,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:52:53,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720579959] [2022-11-20 10:52:53,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:53,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:52:53,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:53,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:52:53,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:52:53,130 INFO L87 Difference]: Start difference. First operand has 209 states, 146 states have (on average 1.36986301369863) internal successors, (200), 165 states have internal predecessors, (200), 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-11-20 10:52:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:53,229 INFO L93 Difference]: Finished difference Result 440 states and 576 transitions. [2022-11-20 10:52:53,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:52:53,238 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-11-20 10:52:53,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:53,248 INFO L225 Difference]: With dead ends: 440 [2022-11-20 10:52:53,248 INFO L226 Difference]: Without dead ends: 211 [2022-11-20 10:52:53,255 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-11-20 10:52:53,262 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 35 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 509 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-11-20 10:52:53,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 509 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:52:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-20 10:52:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-11-20 10:52:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.3506493506493507) internal successors, (208), 168 states have internal predecessors, (208), 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-11-20 10:52:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 268 transitions. [2022-11-20 10:52:53,363 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 268 transitions. Word has length 12 [2022-11-20 10:52:53,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:53,364 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 268 transitions. [2022-11-20 10:52:53,364 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-11-20 10:52:53,364 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 268 transitions. [2022-11-20 10:52:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 10:52:53,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:53,367 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-11-20 10:52:53,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:52:53,368 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-11-20 10:52:53,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:53,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1470941572, now seen corresponding path program 1 times [2022-11-20 10:52:53,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:53,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094184668] [2022-11-20 10:52:53,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:53,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:53,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:52:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:52:53,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:53,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094184668] [2022-11-20 10:52:53,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094184668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:53,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:53,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:52:53,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423031251] [2022-11-20 10:52:53,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:53,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:53,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:53,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:53,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:52:53,654 INFO L87 Difference]: Start difference. First operand 211 states and 268 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 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-11-20 10:52:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:54,296 INFO L93 Difference]: Finished difference Result 435 states and 555 transitions. [2022-11-20 10:52:54,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:52:54,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 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-11-20 10:52:54,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:54,301 INFO L225 Difference]: With dead ends: 435 [2022-11-20 10:52:54,302 INFO L226 Difference]: Without dead ends: 431 [2022-11-20 10:52:54,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:52:54,303 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 262 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:54,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 641 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:52:54,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-11-20 10:52:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 405. [2022-11-20 10:52:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 305 states have (on average 1.340983606557377) internal successors, (409), 320 states have internal predecessors, (409), 60 states have call successors, (60), 26 states have call predecessors, (60), 26 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2022-11-20 10:52:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 529 transitions. [2022-11-20 10:52:54,347 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 529 transitions. Word has length 30 [2022-11-20 10:52:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:54,347 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 529 transitions. [2022-11-20 10:52:54,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 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-11-20 10:52:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 529 transitions. [2022-11-20 10:52:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 10:52:54,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:54,350 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:54,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:52:54,350 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-11-20 10:52:54,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:54,351 INFO L85 PathProgramCache]: Analyzing trace with hash -737337866, now seen corresponding path program 1 times [2022-11-20 10:52:54,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:54,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105835283] [2022-11-20 10:52:54,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:54,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:54,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:52:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:52:54,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:54,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105835283] [2022-11-20 10:52:54,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105835283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:54,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:54,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:52:54,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896341468] [2022-11-20 10:52:54,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:54,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:52:54,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:54,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:52:54,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:52:54,536 INFO L87 Difference]: Start difference. First operand 405 states and 529 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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-11-20 10:52:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:55,182 INFO L93 Difference]: Finished difference Result 1047 states and 1364 transitions. [2022-11-20 10:52:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:52:55,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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 40 [2022-11-20 10:52:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:55,188 INFO L225 Difference]: With dead ends: 1047 [2022-11-20 10:52:55,189 INFO L226 Difference]: Without dead ends: 837 [2022-11-20 10:52:55,190 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-11-20 10:52:55,191 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 321 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:55,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 813 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:52:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2022-11-20 10:52:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 409. [2022-11-20 10:52:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 309 states have (on average 1.3365695792880259) internal successors, (413), 324 states have internal predecessors, (413), 60 states have call successors, (60), 26 states have call predecessors, (60), 26 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2022-11-20 10:52:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 533 transitions. [2022-11-20 10:52:55,244 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 533 transitions. Word has length 40 [2022-11-20 10:52:55,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:55,245 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 533 transitions. [2022-11-20 10:52:55,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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-11-20 10:52:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 533 transitions. [2022-11-20 10:52:55,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:52:55,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:55,248 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-11-20 10:52:55,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:52:55,249 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-11-20 10:52:55,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:55,249 INFO L85 PathProgramCache]: Analyzing trace with hash -233294408, now seen corresponding path program 1 times [2022-11-20 10:52:55,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:55,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455011703] [2022-11-20 10:52:55,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:55,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:55,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:52:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:55,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:52:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:52:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:55,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:52:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:55,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:52:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:52:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:55,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:52:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:52:55,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:55,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455011703] [2022-11-20 10:52:55,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455011703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:55,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:55,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:52:55,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632070170] [2022-11-20 10:52:55,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:55,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:52:55,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:55,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:52:55,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:52:55,395 INFO L87 Difference]: Start difference. First operand 409 states and 533 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-11-20 10:52:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:55,783 INFO L93 Difference]: Finished difference Result 864 states and 1118 transitions. [2022-11-20 10:52:55,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:52:55,784 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-11-20 10:52:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:55,793 INFO L225 Difference]: With dead ends: 864 [2022-11-20 10:52:55,793 INFO L226 Difference]: Without dead ends: 458 [2022-11-20 10:52:55,795 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-11-20 10:52:55,800 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 227 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:55,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 582 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:52:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-11-20 10:52:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 444. [2022-11-20 10:52:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 338 states have (on average 1.319526627218935) internal successors, (446), 353 states have internal predecessors, (446), 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-11-20 10:52:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 564 transitions. [2022-11-20 10:52:55,864 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 564 transitions. Word has length 58 [2022-11-20 10:52:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:55,869 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 564 transitions. [2022-11-20 10:52:55,870 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-11-20 10:52:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 564 transitions. [2022-11-20 10:52:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 10:52:55,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:55,880 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:55,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:52:55,881 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-11-20 10:52:55,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:55,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1543729732, now seen corresponding path program 1 times [2022-11-20 10:52:55,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:55,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459047131] [2022-11-20 10:52:55,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:55,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:55,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:52:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:55,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:52:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:52:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:52:56,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:56,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459047131] [2022-11-20 10:52:56,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459047131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:56,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:56,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:52:56,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977414217] [2022-11-20 10:52:56,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:56,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:52:56,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:56,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:52:56,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:52:56,013 INFO L87 Difference]: Start difference. First operand 444 states and 564 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:52:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:56,532 INFO L93 Difference]: Finished difference Result 1056 states and 1338 transitions. [2022-11-20 10:52:56,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:52:56,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-11-20 10:52:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:56,540 INFO L225 Difference]: With dead ends: 1056 [2022-11-20 10:52:56,540 INFO L226 Difference]: Without dead ends: 788 [2022-11-20 10:52:56,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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-11-20 10:52:56,542 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 281 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:56,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 773 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:52:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-11-20 10:52:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 444. [2022-11-20 10:52:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 338 states have (on average 1.319526627218935) internal successors, (446), 353 states have internal predecessors, (446), 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-11-20 10:52:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 564 transitions. [2022-11-20 10:52:56,599 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 564 transitions. Word has length 56 [2022-11-20 10:52:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:56,599 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 564 transitions. [2022-11-20 10:52:56,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:52:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 564 transitions. [2022-11-20 10:52:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-20 10:52:56,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:56,605 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-11-20 10:52:56,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:52:56,606 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-11-20 10:52:56,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1987107495, now seen corresponding path program 1 times [2022-11-20 10:52:56,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:56,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785531467] [2022-11-20 10:52:56,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:56,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:52:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:56,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:52:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:56,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:52:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:56,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:52:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:56,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:52:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:56,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 10:52:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:56,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:52:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:56,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:52:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:56,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:52:56,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:56,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785531467] [2022-11-20 10:52:56,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785531467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:56,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:56,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:52:56,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136248157] [2022-11-20 10:52:56,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:56,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:52:56,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:56,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:52:56,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:52:56,813 INFO L87 Difference]: Start difference. First operand 444 states and 564 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-11-20 10:52:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:57,130 INFO L93 Difference]: Finished difference Result 934 states and 1205 transitions. [2022-11-20 10:52:57,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:52:57,131 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-11-20 10:52:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:57,133 INFO L225 Difference]: With dead ends: 934 [2022-11-20 10:52:57,134 INFO L226 Difference]: Without dead ends: 510 [2022-11-20 10:52:57,135 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-11-20 10:52:57,135 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 114 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:57,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 472 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:52:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-20 10:52:57,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 496. [2022-11-20 10:52:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 384 states have (on average 1.328125) internal successors, (510), 399 states have internal predecessors, (510), 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-11-20 10:52:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 640 transitions. [2022-11-20 10:52:57,176 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 640 transitions. Word has length 80 [2022-11-20 10:52:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:57,177 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 640 transitions. [2022-11-20 10:52:57,177 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-11-20 10:52:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 640 transitions. [2022-11-20 10:52:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-20 10:52:57,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:57,179 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-11-20 10:52:57,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:52:57,179 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-11-20 10:52:57,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1009855611, now seen corresponding path program 1 times [2022-11-20 10:52:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:57,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251055483] [2022-11-20 10:52:57,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:57,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:52:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:57,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:52:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:52:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:57,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:52:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:57,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:52:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:57,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 10:52:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:57,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:52:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:57,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:52:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:52:57,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:57,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251055483] [2022-11-20 10:52:57,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251055483] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:57,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408009553] [2022-11-20 10:52:57,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:57,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:57,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:57,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:57,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:52:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:57,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:52:57,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:52:57,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:52:57,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408009553] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:57,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:57,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-20 10:52:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400100233] [2022-11-20 10:52:57,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:57,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:52:57,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:57,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:52:57,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:52:57,736 INFO L87 Difference]: Start difference. First operand 496 states and 640 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-11-20 10:52:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:58,388 INFO L93 Difference]: Finished difference Result 948 states and 1293 transitions. [2022-11-20 10:52:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:52:58,389 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-11-20 10:52:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:58,393 INFO L225 Difference]: With dead ends: 948 [2022-11-20 10:52:58,393 INFO L226 Difference]: Without dead ends: 944 [2022-11-20 10:52:58,394 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-11-20 10:52:58,395 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 422 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:58,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1312 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:52:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2022-11-20 10:52:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 549. [2022-11-20 10:52:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 432 states have (on average 1.3333333333333333) internal successors, (576), 444 states have internal predecessors, (576), 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-11-20 10:52:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 722 transitions. [2022-11-20 10:52:58,445 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 722 transitions. Word has length 85 [2022-11-20 10:52:58,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:58,446 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 722 transitions. [2022-11-20 10:52:58,446 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-11-20 10:52:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 722 transitions. [2022-11-20 10:52:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-20 10:52:58,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:58,448 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-11-20 10:52:58,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:58,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 10:52:58,654 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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-11-20 10:52:58,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1240753136, now seen corresponding path program 1 times [2022-11-20 10:52:58,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:58,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316372137] [2022-11-20 10:52:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:58,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:58,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:52:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:58,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:52:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:58,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:52:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:58,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:52:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:58,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:52:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:58,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 10:52:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:58,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:52:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:58,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:52:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:52:58,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:58,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316372137] [2022-11-20 10:52:58,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316372137] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:58,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58602591] [2022-11-20 10:52:58,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:58,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:58,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:58,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:58,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:52:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:59,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:52:59,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:52:59,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:52:59,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58602591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:59,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:52:59,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-20 10:52:59,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651152294] [2022-11-20 10:52:59,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:59,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:59,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:59,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:59,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:52:59,115 INFO L87 Difference]: Start difference. First operand 549 states and 722 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-11-20 10:52:59,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:59,240 INFO L93 Difference]: Finished difference Result 1200 states and 1593 transitions. [2022-11-20 10:52:59,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:52:59,241 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-11-20 10:52:59,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:59,244 INFO L225 Difference]: With dead ends: 1200 [2022-11-20 10:52:59,244 INFO L226 Difference]: Without dead ends: 671 [2022-11-20 10:52:59,245 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-11-20 10:52:59,246 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 171 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 558 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-11-20 10:52:59,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 558 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:52:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-11-20 10:52:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 488. [2022-11-20 10:52:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 382 states have (on average 1.2984293193717278) internal successors, (496), 391 states have internal predecessors, (496), 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-11-20 10:52:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 626 transitions. [2022-11-20 10:52:59,314 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 626 transitions. Word has length 86 [2022-11-20 10:52:59,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:59,315 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 626 transitions. [2022-11-20 10:52:59,315 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-11-20 10:52:59,315 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 626 transitions. [2022-11-20 10:52:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-20 10:52:59,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:59,334 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, 1] [2022-11-20 10:52:59,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 10:52:59,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:59,540 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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-11-20 10:52:59,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:59,540 INFO L85 PathProgramCache]: Analyzing trace with hash 526978300, now seen corresponding path program 1 times [2022-11-20 10:52:59,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:59,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95856749] [2022-11-20 10:52:59,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:59,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:59,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:52:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:52:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:59,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:52:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:59,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:52:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:59,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:52:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 10:52:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:59,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:52:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:59,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:52:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:52:59,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:59,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95856749] [2022-11-20 10:52:59,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95856749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:59,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:59,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:52:59,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767566016] [2022-11-20 10:52:59,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:59,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:52:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:59,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:52:59,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:52:59,828 INFO L87 Difference]: Start difference. First operand 488 states and 626 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-11-20 10:53:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:00,400 INFO L93 Difference]: Finished difference Result 982 states and 1267 transitions. [2022-11-20 10:53:00,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:53:00,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 87 [2022-11-20 10:53:00,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:00,406 INFO L225 Difference]: With dead ends: 982 [2022-11-20 10:53:00,407 INFO L226 Difference]: Without dead ends: 980 [2022-11-20 10:53:00,408 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-11-20 10:53:00,410 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 244 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:00,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 643 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:53:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2022-11-20 10:53:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 946. [2022-11-20 10:53:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 742 states have (on average 1.2924528301886793) internal successors, (959), 753 states have internal predecessors, (959), 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-11-20 10:53:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1227 transitions. [2022-11-20 10:53:00,550 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1227 transitions. Word has length 87 [2022-11-20 10:53:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:00,550 INFO L495 AbstractCegarLoop]: Abstraction has 946 states and 1227 transitions. [2022-11-20 10:53:00,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-11-20 10:53:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1227 transitions. [2022-11-20 10:53:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-20 10:53:00,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:00,554 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, 1, 1] [2022-11-20 10:53:00,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:53:00,554 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-11-20 10:53:00,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:00,555 INFO L85 PathProgramCache]: Analyzing trace with hash -225818043, now seen corresponding path program 1 times [2022-11-20 10:53:00,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:00,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393912522] [2022-11-20 10:53:00,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:00,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:53:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:00,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:53:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:00,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:53:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:00,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:53:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:00,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:00,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 10:53:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:00,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:53:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:00,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:00,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:53:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 10:53:00,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:00,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393912522] [2022-11-20 10:53:00,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393912522] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:53:00,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109157298] [2022-11-20 10:53:00,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:00,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:00,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:53:00,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:53:01,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:53:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:01,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:53:01,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:53:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:53:01,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:53:01,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109157298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:01,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:53:01,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2022-11-20 10:53:01,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777974228] [2022-11-20 10:53:01,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:01,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:53:01,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:01,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:53:01,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:53:01,768 INFO L87 Difference]: Start difference. First operand 946 states and 1227 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-11-20 10:53:02,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:02,155 INFO L93 Difference]: Finished difference Result 962 states and 1235 transitions. [2022-11-20 10:53:02,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:53:02,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 102 [2022-11-20 10:53:02,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:02,159 INFO L225 Difference]: With dead ends: 962 [2022-11-20 10:53:02,160 INFO L226 Difference]: Without dead ends: 480 [2022-11-20 10:53:02,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 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-11-20 10:53:02,164 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 181 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:02,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 426 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:53:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-11-20 10:53:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2022-11-20 10:53:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 376 states have (on average 1.2872340425531914) internal successors, (484), 383 states have internal predecessors, (484), 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-11-20 10:53:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 614 transitions. [2022-11-20 10:53:02,214 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 614 transitions. Word has length 102 [2022-11-20 10:53:02,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:02,215 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 614 transitions. [2022-11-20 10:53:02,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-11-20 10:53:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 614 transitions. [2022-11-20 10:53:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-20 10:53:02,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:02,217 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-11-20 10:53:02,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:53:02,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 10:53:02,429 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-11-20 10:53:02,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:02,430 INFO L85 PathProgramCache]: Analyzing trace with hash 884730723, now seen corresponding path program 1 times [2022-11-20 10:53:02,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:02,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474379797] [2022-11-20 10:53:02,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:02,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:53:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:53:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:53:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:53:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:53:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 10:53:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:53:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:53:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:53:02,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:02,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474379797] [2022-11-20 10:53:02,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474379797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:02,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:53:02,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:53:02,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738608987] [2022-11-20 10:53:02,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:02,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:53:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:02,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:53:02,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:53:02,618 INFO L87 Difference]: Start difference. First operand 480 states and 614 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-11-20 10:53:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:02,954 INFO L93 Difference]: Finished difference Result 778 states and 995 transitions. [2022-11-20 10:53:02,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:53:02,954 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-11-20 10:53:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:02,957 INFO L225 Difference]: With dead ends: 778 [2022-11-20 10:53:02,958 INFO L226 Difference]: Without dead ends: 498 [2022-11-20 10:53:02,959 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-11-20 10:53:02,959 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 40 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:02,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 587 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:53:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-11-20 10:53:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 484. [2022-11-20 10:53:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 379 states have (on average 1.2849604221635884) internal successors, (487), 386 states have internal predecessors, (487), 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-11-20 10:53:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 619 transitions. [2022-11-20 10:53:03,030 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 619 transitions. Word has length 105 [2022-11-20 10:53:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:03,031 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 619 transitions. [2022-11-20 10:53:03,031 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-11-20 10:53:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 619 transitions. [2022-11-20 10:53:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-20 10:53:03,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:03,034 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-11-20 10:53:03,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:53:03,034 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-11-20 10:53:03,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:03,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1842214503, now seen corresponding path program 1 times [2022-11-20 10:53:03,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:03,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702655194] [2022-11-20 10:53:03,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:03,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:53:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:53:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:53:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:53:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:53:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 10:53:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:53:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:53:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:53:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 10:53:03,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:03,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702655194] [2022-11-20 10:53:03,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702655194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:53:03,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463325034] [2022-11-20 10:53:03,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:03,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:03,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:53:03,275 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:53:03,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:53:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:53:03,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:53:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 10:53:03,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:53:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 10:53:03,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463325034] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:53:03,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:53:03,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-20 10:53:03,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518749864] [2022-11-20 10:53:03,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:53:03,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:53:03,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:03,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:53:03,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:53:03,696 INFO L87 Difference]: Start difference. First operand 484 states and 619 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-11-20 10:53:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:04,570 INFO L93 Difference]: Finished difference Result 1013 states and 1389 transitions. [2022-11-20 10:53:04,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:53:04,571 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-11-20 10:53:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:04,575 INFO L225 Difference]: With dead ends: 1013 [2022-11-20 10:53:04,575 INFO L226 Difference]: Without dead ends: 1012 [2022-11-20 10:53:04,576 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-11-20 10:53:04,577 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 515 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:04,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1760 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:53:04,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2022-11-20 10:53:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 483. [2022-11-20 10:53:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 379 states have (on average 1.2823218997361479) internal successors, (486), 385 states have internal predecessors, (486), 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-11-20 10:53:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 618 transitions. [2022-11-20 10:53:04,639 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 618 transitions. Word has length 120 [2022-11-20 10:53:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:04,639 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 618 transitions. [2022-11-20 10:53:04,640 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-11-20 10:53:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 618 transitions. [2022-11-20 10:53:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-20 10:53:04,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:04,643 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-11-20 10:53:04,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:53:04,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 10:53:04,850 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-11-20 10:53:04,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:04,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1274074425, now seen corresponding path program 1 times [2022-11-20 10:53:04,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:04,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861804475] [2022-11-20 10:53:04,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:04,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:53:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:53:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:53:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:53:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:53:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 10:53:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:53:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:53:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:53:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 10:53:05,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:05,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861804475] [2022-11-20 10:53:05,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861804475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:53:05,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347264137] [2022-11-20 10:53:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:05,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:05,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:53:05,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:53:05,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:53:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:05,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:53:05,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:53:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 10:53:05,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:53:05,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347264137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:05,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:53:05,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-20 10:53:05,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025636666] [2022-11-20 10:53:05,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:05,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:53:05,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:05,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:53:05,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:53:05,417 INFO L87 Difference]: Start difference. First operand 483 states and 618 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-11-20 10:53:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:05,528 INFO L93 Difference]: Finished difference Result 647 states and 854 transitions. [2022-11-20 10:53:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:53:05,529 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-11-20 10:53:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:05,533 INFO L225 Difference]: With dead ends: 647 [2022-11-20 10:53:05,533 INFO L226 Difference]: Without dead ends: 646 [2022-11-20 10:53:05,533 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-11-20 10:53:05,535 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 236 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 597 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-11-20 10:53:05,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 597 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:53:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-11-20 10:53:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 479. [2022-11-20 10:53:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 377 states have (on average 1.2811671087533156) internal successors, (483), 382 states have internal predecessors, (483), 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-11-20 10:53:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 613 transitions. [2022-11-20 10:53:05,624 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 613 transitions. Word has length 121 [2022-11-20 10:53:05,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:05,625 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 613 transitions. [2022-11-20 10:53:05,625 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-11-20 10:53:05,625 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 613 transitions. [2022-11-20 10:53:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-20 10:53:05,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:05,628 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-11-20 10:53:05,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 10:53:05,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:05,834 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-11-20 10:53:05,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:05,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1673402574, now seen corresponding path program 1 times [2022-11-20 10:53:05,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:05,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635091823] [2022-11-20 10:53:05,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:05,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:53:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:53:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:53:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:53:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:53:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 10:53:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-20 10:53:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:53:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 10:53:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 10:53:06,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:06,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635091823] [2022-11-20 10:53:06,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635091823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:06,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:53:06,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:53:06,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307006805] [2022-11-20 10:53:06,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:06,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:53:06,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:06,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:53:06,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:53:06,083 INFO L87 Difference]: Start difference. First operand 479 states and 613 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-11-20 10:53:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:06,400 INFO L93 Difference]: Finished difference Result 755 states and 961 transitions. [2022-11-20 10:53:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:53:06,401 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-11-20 10:53:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:06,403 INFO L225 Difference]: With dead ends: 755 [2022-11-20 10:53:06,404 INFO L226 Difference]: Without dead ends: 476 [2022-11-20 10:53:06,405 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-11-20 10:53:06,405 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 167 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:06,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 510 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:53:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-20 10:53:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 462. [2022-11-20 10:53:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 360 states have (on average 1.2666666666666666) internal successors, (456), 365 states have internal predecessors, (456), 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-11-20 10:53:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 586 transitions. [2022-11-20 10:53:06,458 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 586 transitions. Word has length 114 [2022-11-20 10:53:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:06,459 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 586 transitions. [2022-11-20 10:53:06,459 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-11-20 10:53:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 586 transitions. [2022-11-20 10:53:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-20 10:53:06,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:06,462 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-11-20 10:53:06,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:53:06,462 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-11-20 10:53:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:06,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1111698611, now seen corresponding path program 1 times [2022-11-20 10:53:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:06,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378286278] [2022-11-20 10:53:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:53:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:53:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:53:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:53:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:53:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 10:53:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:53:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:53:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:53:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-20 10:53:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 10:53:06,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:06,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378286278] [2022-11-20 10:53:06,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378286278] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:53:06,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376630383] [2022-11-20 10:53:06,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:06,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:06,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:53:06,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:53:06,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:53:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:53:06,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:53:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:53:07,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:53:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 10:53:07,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376630383] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:53:07,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:53:07,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-20 10:53:07,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565761013] [2022-11-20 10:53:07,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:53:07,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:53:07,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:07,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:53:07,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:53:07,334 INFO L87 Difference]: Start difference. First operand 462 states and 586 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-11-20 10:53:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:08,698 INFO L93 Difference]: Finished difference Result 1197 states and 1520 transitions. [2022-11-20 10:53:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:53:08,699 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-11-20 10:53:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:08,704 INFO L225 Difference]: With dead ends: 1197 [2022-11-20 10:53:08,705 INFO L226 Difference]: Without dead ends: 1195 [2022-11-20 10:53:08,707 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-11-20 10:53:08,708 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 1494 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:08,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 933 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 10:53:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-11-20 10:53:08,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 898. [2022-11-20 10:53:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 699 states have (on average 1.2603719599427754) internal successors, (881), 705 states have internal predecessors, (881), 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-11-20 10:53:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1141 transitions. [2022-11-20 10:53:08,842 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1141 transitions. Word has length 119 [2022-11-20 10:53:08,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:08,843 INFO L495 AbstractCegarLoop]: Abstraction has 898 states and 1141 transitions. [2022-11-20 10:53:08,843 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-11-20 10:53:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1141 transitions. [2022-11-20 10:53:08,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-20 10:53:08,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:08,847 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-11-20 10:53:08,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:53:09,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:09,054 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-11-20 10:53:09,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:09,054 INFO L85 PathProgramCache]: Analyzing trace with hash -102918237, now seen corresponding path program 1 times [2022-11-20 10:53:09,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:09,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944413396] [2022-11-20 10:53:09,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:09,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:53:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:53:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:53:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:53:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:53:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 10:53:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:53:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:53:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 10:53:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-20 10:53:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 10:53:09,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:09,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944413396] [2022-11-20 10:53:09,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944413396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:53:09,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582537118] [2022-11-20 10:53:09,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:09,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:09,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:53:09,288 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:53:09,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:53:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:53:09,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:53:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:53:09,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:53:09,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582537118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:09,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:53:09,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-20 10:53:09,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999057268] [2022-11-20 10:53:09,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:09,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:53:09,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:09,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:53:09,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:53:09,755 INFO L87 Difference]: Start difference. First operand 898 states and 1141 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-11-20 10:53:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:09,996 INFO L93 Difference]: Finished difference Result 1078 states and 1375 transitions. [2022-11-20 10:53:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:53:09,997 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-11-20 10:53:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:10,002 INFO L225 Difference]: With dead ends: 1078 [2022-11-20 10:53:10,002 INFO L226 Difference]: Without dead ends: 1076 [2022-11-20 10:53:10,003 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-11-20 10:53:10,004 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 328 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 541 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-11-20 10:53:10,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 541 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:53:10,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-11-20 10:53:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 716. [2022-11-20 10:53:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 558 states have (on average 1.2526881720430108) internal successors, (699), 561 states have internal predecessors, (699), 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-11-20 10:53:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 905 transitions. [2022-11-20 10:53:10,142 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 905 transitions. Word has length 120 [2022-11-20 10:53:10,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:10,143 INFO L495 AbstractCegarLoop]: Abstraction has 716 states and 905 transitions. [2022-11-20 10:53:10,143 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-11-20 10:53:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 905 transitions. [2022-11-20 10:53:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-11-20 10:53:10,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:10,147 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-11-20 10:53:10,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 10:53:10,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 10:53:10,355 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-11-20 10:53:10,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:10,356 INFO L85 PathProgramCache]: Analyzing trace with hash -736431107, now seen corresponding path program 2 times [2022-11-20 10:53:10,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:10,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717168147] [2022-11-20 10:53:10,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:10,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:53:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:53:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 10:53:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:53:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:53:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 10:53:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:53:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 10:53:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-20 10:53:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-20 10:53:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-20 10:53:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-20 10:53:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-20 10:53:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-20 10:53:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:53:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-20 10:53:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-20 10:53:10,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:10,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717168147] [2022-11-20 10:53:10,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717168147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:10,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:53:10,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:53:10,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220600146] [2022-11-20 10:53:10,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:10,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:53:10,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:10,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:53:10,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:53:10,608 INFO L87 Difference]: Start difference. First operand 716 states and 905 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-11-20 10:53:10,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:10,921 INFO L93 Difference]: Finished difference Result 977 states and 1231 transitions. [2022-11-20 10:53:10,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:53:10,922 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-11-20 10:53:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:10,922 INFO L225 Difference]: With dead ends: 977 [2022-11-20 10:53:10,922 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 10:53:10,924 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-11-20 10:53:10,925 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 195 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:10,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 482 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:53:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 10:53:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 10:53:10,926 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-11-20 10:53:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 10:53:10,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 197 [2022-11-20 10:53:10,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:10,927 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 10:53:10,927 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-11-20 10:53:10,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 10:53:10,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 10:53:10,931 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-11-20 10:53:10,932 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-11-20 10:53:10,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-20 10:53:10,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-20 10:53:10,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-20 10:53:10,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-20 10:53:10,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-20 10:53:10,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-20 10:53:10,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-20 10:53:10,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-20 10:53:10,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-20 10:53:10,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-20 10:53:10,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-20 10:53:10,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-20 10:53:10,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:53:10,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 10:53:17,094 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_rawENTRY(lines 938 943) the Hoare annotation is: true [2022-11-20 10:53:17,094 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawFINAL(lines 938 943) no Hoare annotation was computed. [2022-11-20 10:53:17,094 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawEXIT(lines 938 943) no Hoare annotation was computed. [2022-11-20 10:53:17,095 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-11-20 10:53:17,095 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-11-20 10:53:17,095 INFO L899 garLoopResultBuilder]: For program point L1407-1(line 1407) no Hoare annotation was computed. [2022-11-20 10:53:17,095 INFO L902 garLoopResultBuilder]: At program point L1407-2(lines 1406 1408) the Hoare annotation is: true [2022-11-20 10:53:17,096 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataEXIT(lines 893 900) no Hoare annotation was computed. [2022-11-20 10:53:17,096 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataFINAL(lines 893 900) no Hoare annotation was computed. [2022-11-20 10:53:17,096 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-11-20 10:53:17,096 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-11-20 10:53:17,096 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-11-20 10:53:17,096 INFO L895 garLoopResultBuilder]: At program point L845(lines 840 847) the Hoare annotation is: (or (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_state_variable_1~0 1)) (not (= ~ldv_state_variable_0~0 3)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-11-20 10:53:17,097 INFO L902 garLoopResultBuilder]: At program point L1385(line 1385) the Hoare annotation is: true [2022-11-20 10:53:17,097 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 (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_state_variable_1~0 1)) (not (= ~ldv_state_variable_0~0 3)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0)) (not (<= ~ldv_count_1~0 0))) [2022-11-20 10:53:17,097 INFO L899 garLoopResultBuilder]: For program point L1383(lines 1383 1386) no Hoare annotation was computed. [2022-11-20 10:53:17,097 INFO L899 garLoopResultBuilder]: For program point L1381(line 1381) no Hoare annotation was computed. [2022-11-20 10:53:17,097 INFO L899 garLoopResultBuilder]: For program point L1380(lines 1380 1388) no Hoare annotation was computed. [2022-11-20 10:53:17,098 INFO L899 garLoopResultBuilder]: For program point L1381-1(line 1381) no Hoare annotation was computed. [2022-11-20 10:53:17,098 INFO L899 garLoopResultBuilder]: For program point L1380-1(lines 1380 1388) no Hoare annotation was computed. [2022-11-20 10:53:17,098 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-11-20 10:53:17,098 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 1426 1428) no Hoare annotation was computed. [2022-11-20 10:53:17,098 INFO L902 garLoopResultBuilder]: At program point hwmon_device_unregisterENTRY(lines 1426 1428) the Hoare annotation is: true [2022-11-20 10:53:17,098 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 1426 1428) no Hoare annotation was computed. [2022-11-20 10:53:17,098 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 856 862) no Hoare annotation was computed. [2022-11-20 10:53:17,099 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 856 862) the Hoare annotation is: true [2022-11-20 10:53:17,099 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 856 862) no Hoare annotation was computed. [2022-11-20 10:53:17,099 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 863 869) no Hoare annotation was computed. [2022-11-20 10:53:17,099 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 863 869) the Hoare annotation is: true [2022-11-20 10:53:17,099 INFO L902 garLoopResultBuilder]: At program point s3c_adc_releaseENTRY(lines 1453 1455) the Hoare annotation is: true [2022-11-20 10:53:17,099 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseEXIT(lines 1453 1455) no Hoare annotation was computed. [2022-11-20 10:53:17,100 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseFINAL(lines 1453 1455) no Hoare annotation was computed. [2022-11-20 10:53:17,100 INFO L899 garLoopResultBuilder]: For program point L801(line 801) no Hoare annotation was computed. [2022-11-20 10:53:17,100 INFO L899 garLoopResultBuilder]: For program point L801-2(lines 800 802) no Hoare annotation was computed. [2022-11-20 10:53:17,100 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 800 802) the Hoare annotation is: true [2022-11-20 10:53:17,100 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 800 802) no Hoare annotation was computed. [2022-11-20 10:53:17,100 INFO L902 garLoopResultBuilder]: At program point L1345(lines 1342 1347) the Hoare annotation is: true [2022-11-20 10:53:17,100 INFO L899 garLoopResultBuilder]: For program point PTR_ERREXIT(lines 1290 1297) no Hoare annotation was computed. [2022-11-20 10:53:17,101 INFO L902 garLoopResultBuilder]: At program point PTR_ERRENTRY(lines 1290 1297) the Hoare annotation is: true [2022-11-20 10:53:17,101 INFO L899 garLoopResultBuilder]: For program point PTR_ERRFINAL(lines 1290 1297) no Hoare annotation was computed. [2022-11-20 10:53:17,101 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 1330 1335) no Hoare annotation was computed. [2022-11-20 10:53:17,101 INFO L902 garLoopResultBuilder]: At program point ldv_is_errENTRY(lines 1330 1335) the Hoare annotation is: true [2022-11-20 10:53:17,101 INFO L899 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 1330 1335) no Hoare annotation was computed. [2022-11-20 10:53:17,101 INFO L899 garLoopResultBuilder]: For program point L817(line 817) no Hoare annotation was computed. [2022-11-20 10:53:17,101 INFO L902 garLoopResultBuilder]: At program point L816(line 816) the Hoare annotation is: true [2022-11-20 10:53:17,102 INFO L902 garLoopResultBuilder]: At program point L817-1(line 817) the Hoare annotation is: true [2022-11-20 10:53:17,102 INFO L902 garLoopResultBuilder]: At program point L816-1(line 816) the Hoare annotation is: true [2022-11-20 10:53:17,102 INFO L899 garLoopResultBuilder]: For program point L817-2(line 817) no Hoare annotation was computed. [2022-11-20 10:53:17,102 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-11-20 10:53:17,102 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 819) no Hoare annotation was computed. [2022-11-20 10:53:17,103 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 804 821) no Hoare annotation was computed. [2022-11-20 10:53:17,103 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 804 821) no Hoare annotation was computed. [2022-11-20 10:53:17,103 INFO L902 garLoopResultBuilder]: At program point L834-1(line 834) the Hoare annotation is: true [2022-11-20 10:53:17,103 INFO L899 garLoopResultBuilder]: For program point L835-2(line 835) no Hoare annotation was computed. [2022-11-20 10:53:17,103 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 10:53:17,103 INFO L899 garLoopResultBuilder]: For program point L829(lines 829 837) no Hoare annotation was computed. [2022-11-20 10:53:17,103 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 822 839) no Hoare annotation was computed. [2022-11-20 10:53:17,104 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-11-20 10:53:17,104 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 822 839) no Hoare annotation was computed. [2022-11-20 10:53:17,104 INFO L899 garLoopResultBuilder]: For program point L835(line 835) no Hoare annotation was computed. [2022-11-20 10:53:17,104 INFO L902 garLoopResultBuilder]: At program point L834(line 834) the Hoare annotation is: true [2022-11-20 10:53:17,104 INFO L902 garLoopResultBuilder]: At program point L835-1(line 835) the Hoare annotation is: true [2022-11-20 10:53:17,104 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 1420 1422) no Hoare annotation was computed. [2022-11-20 10:53:17,105 INFO L902 garLoopResultBuilder]: At program point device_remove_fileENTRY(lines 1420 1422) the Hoare annotation is: true [2022-11-20 10:53:17,105 INFO L899 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 1420 1422) no Hoare annotation was computed. [2022-11-20 10:53:17,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-20 10:53:17,105 INFO L902 garLoopResultBuilder]: At program point L1274(line 1274) the Hoare annotation is: true [2022-11-20 10:53:17,105 INFO L899 garLoopResultBuilder]: For program point L1159(line 1159) no Hoare annotation was computed. [2022-11-20 10:53:17,105 INFO L895 garLoopResultBuilder]: At program point L1027(lines 994 1029) 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 .cse3 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse4 .cse5))) [2022-11-20 10:53:17,106 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 10:53:17,106 INFO L895 garLoopResultBuilder]: At program point L1143(lines 1038 1145) 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-11-20 10:53:17,106 INFO L899 garLoopResultBuilder]: For program point L1457(lines 1457 1459) no Hoare annotation was computed. [2022-11-20 10:53:17,106 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-11-20 10:53:17,106 INFO L899 garLoopResultBuilder]: For program point L1424-1(line 1424) no Hoare annotation was computed. [2022-11-20 10:53:17,106 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-11-20 10:53:17,107 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 1264) no Hoare annotation was computed. [2022-11-20 10:53:17,107 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1159) no Hoare annotation was computed. [2022-11-20 10:53:17,107 INFO L899 garLoopResultBuilder]: For program point L1259-2(lines 1257 1270) no Hoare annotation was computed. [2022-11-20 10:53:17,107 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-11-20 10:53:17,107 INFO L895 garLoopResultBuilder]: At program point L1127(lines 1051 1144) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (let ((.cse0 (= ~ldv_state_variable_1~0 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646)) (and (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse0))) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-20 10:53:17,108 INFO L899 garLoopResultBuilder]: For program point L1061(lines 1061 1065) no Hoare annotation was computed. [2022-11-20 10:53:17,108 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-11-20 10:53:17,108 INFO L899 garLoopResultBuilder]: For program point L1111(lines 1111 1126) no Hoare annotation was computed. [2022-11-20 10:53:17,108 INFO L899 garLoopResultBuilder]: For program point L1078(lines 1078 1081) no Hoare annotation was computed. [2022-11-20 10:53:17,108 INFO L899 garLoopResultBuilder]: For program point L1012(lines 1012 1026) no Hoare annotation was computed. [2022-11-20 10:53:17,108 INFO L899 garLoopResultBuilder]: For program point L1012-1(lines 1012 1026) no Hoare annotation was computed. [2022-11-20 10:53:17,109 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-11-20 10:53:17,109 INFO L899 garLoopResultBuilder]: For program point L1326-1(line 1326) no Hoare annotation was computed. [2022-11-20 10:53:17,109 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1159) no Hoare annotation was computed. [2022-11-20 10:53:17,109 INFO L899 garLoopResultBuilder]: For program point L1128(line 1128) no Hoare annotation was computed. [2022-11-20 10:53:17,109 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1095 1098) no Hoare annotation was computed. [2022-11-20 10:53:17,109 INFO L895 garLoopResultBuilder]: At program point L1310(line 1310) 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 .cse3 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse4 .cse5))) [2022-11-20 10:53:17,109 INFO L899 garLoopResultBuilder]: For program point L1310-1(line 1310) no Hoare annotation was computed. [2022-11-20 10:53:17,110 INFO L899 garLoopResultBuilder]: For program point L1244(line 1244) no Hoare annotation was computed. [2022-11-20 10:53:17,110 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-11-20 10:53:17,110 INFO L895 garLoopResultBuilder]: At program point L1013-1(line 1013) 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 .cse3 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse4 .cse5))) [2022-11-20 10:53:17,110 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-11-20 10:53:17,110 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-11-20 10:53:17,111 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-11-20 10:53:17,111 INFO L895 garLoopResultBuilder]: At program point L1311(lines 1306 1313) 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 .cse3 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse4 .cse5))) [2022-11-20 10:53:17,111 INFO L899 garLoopResultBuilder]: For program point L1245(lines 1245 1278) no Hoare annotation was computed. [2022-11-20 10:53:17,111 INFO L899 garLoopResultBuilder]: For program point L1229(line 1229) no Hoare annotation was computed. [2022-11-20 10:53:17,111 INFO L895 garLoopResultBuilder]: At program point L1196(line 1196) 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-11-20 10:53:17,111 INFO L899 garLoopResultBuilder]: For program point L1196-1(line 1196) no Hoare annotation was computed. [2022-11-20 10:53:17,112 INFO L902 garLoopResultBuilder]: At program point L1444(lines 1443 1445) the Hoare annotation is: true [2022-11-20 10:53:17,112 INFO L899 garLoopResultBuilder]: For program point L1213(lines 1213 1282) no Hoare annotation was computed. [2022-11-20 10:53:17,112 INFO L899 garLoopResultBuilder]: For program point L1114(line 1114) no Hoare annotation was computed. [2022-11-20 10:53:17,112 INFO L899 garLoopResultBuilder]: For program point L1114-1(line 1114) no Hoare annotation was computed. [2022-11-20 10:53:17,112 INFO L899 garLoopResultBuilder]: For program point L1230(lines 1230 1235) no Hoare annotation was computed. [2022-11-20 10:53:17,112 INFO L895 garLoopResultBuilder]: At program point L1131(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 .cse3 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse4 .cse5))) [2022-11-20 10:53:17,113 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 10:53:17,113 INFO L899 garLoopResultBuilder]: For program point L1280(line 1280) no Hoare annotation was computed. [2022-11-20 10:53:17,113 INFO L899 garLoopResultBuilder]: For program point L1247(lines 1247 1275) no Hoare annotation was computed. [2022-11-20 10:53:17,113 INFO L899 garLoopResultBuilder]: For program point L1214(line 1214) no Hoare annotation was computed. [2022-11-20 10:53:17,113 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-11-20 10:53:17,113 INFO L895 garLoopResultBuilder]: At program point L1198(lines 1192 1200) 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-11-20 10:53:17,114 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-11-20 10:53:17,114 INFO L899 garLoopResultBuilder]: For program point L1165-1(line 1165) no Hoare annotation was computed. [2022-11-20 10:53:17,114 INFO L899 garLoopResultBuilder]: For program point L1099(lines 1099 1103) no Hoare annotation was computed. [2022-11-20 10:53:17,114 INFO L899 garLoopResultBuilder]: For program point L1099-2(lines 1099 1103) no Hoare annotation was computed. [2022-11-20 10:53:17,114 INFO L895 garLoopResultBuilder]: At program point L1000-1(line 1000) 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 .cse3 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse4 .cse5))) [2022-11-20 10:53:17,114 INFO L902 garLoopResultBuilder]: At program point L1281(line 1281) the Hoare annotation is: true [2022-11-20 10:53:17,114 INFO L899 garLoopResultBuilder]: For program point L1248(line 1248) no Hoare annotation was computed. [2022-11-20 10:53:17,115 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1242) no Hoare annotation was computed. [2022-11-20 10:53:17,115 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-20 10:53:17,115 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-11-20 10:53:17,115 INFO L899 garLoopResultBuilder]: For program point L1083-1(line 1083) no Hoare annotation was computed. [2022-11-20 10:53:17,115 INFO L902 garLoopResultBuilder]: At program point L1430(lines 1429 1431) the Hoare annotation is: true [2022-11-20 10:53:17,115 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-11-20 10:53:17,116 INFO L899 garLoopResultBuilder]: For program point L1166-1(line 1166) no Hoare annotation was computed. [2022-11-20 10:53:17,116 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1223) no Hoare annotation was computed. [2022-11-20 10:53:17,116 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-11-20 10:53:17,116 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-11-20 10:53:17,116 INFO L899 garLoopResultBuilder]: For program point L1249(lines 1249 1254) no Hoare annotation was computed. [2022-11-20 10:53:17,116 INFO L899 garLoopResultBuilder]: For program point L1117(line 1117) no Hoare annotation was computed. [2022-11-20 10:53:17,117 INFO L899 garLoopResultBuilder]: For program point L1084(lines 1084 1090) no Hoare annotation was computed. [2022-11-20 10:53:17,117 INFO L899 garLoopResultBuilder]: For program point L1233(line 1233) no Hoare annotation was computed. [2022-11-20 10:53:17,117 INFO L899 garLoopResultBuilder]: For program point L1233-1(line 1233) no Hoare annotation was computed. [2022-11-20 10:53:17,117 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-11-20 10:53:17,117 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1223) no Hoare annotation was computed. [2022-11-20 10:53:17,118 INFO L895 garLoopResultBuilder]: At program point L1283(lines 1206 1288) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_count_2~0 0)) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) .cse1) (and .cse0 (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1)) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse1 .cse2))) [2022-11-20 10:53:17,118 INFO L899 garLoopResultBuilder]: For program point L1217(lines 1217 1239) no Hoare annotation was computed. [2022-11-20 10:53:17,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1114) no Hoare annotation was computed. [2022-11-20 10:53:17,118 INFO L899 garLoopResultBuilder]: For program point L1118(line 1118) no Hoare annotation was computed. [2022-11-20 10:53:17,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 10:53:17,118 INFO L902 garLoopResultBuilder]: At program point L1267(lines 1206 1288) the Hoare annotation is: true [2022-11-20 10:53:17,118 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-11-20 10:53:17,119 INFO L899 garLoopResultBuilder]: For program point L1069-1(line 1069) no Hoare annotation was computed. [2022-11-20 10:53:17,119 INFO L899 garLoopResultBuilder]: For program point L1218(line 1218) no Hoare annotation was computed. [2022-11-20 10:53:17,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1114) no Hoare annotation was computed. [2022-11-20 10:53:17,119 INFO L902 garLoopResultBuilder]: At program point L1185(lines 1181 1187) the Hoare annotation is: true [2022-11-20 10:53:17,119 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-11-20 10:53:17,119 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-11-20 10:53:17,120 INFO L899 garLoopResultBuilder]: For program point L1152-1(line 1152) no Hoare annotation was computed. [2022-11-20 10:53:17,120 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-11-20 10:53:17,120 INFO L899 garLoopResultBuilder]: For program point L1086-1(line 1086) no Hoare annotation was computed. [2022-11-20 10:53:17,120 INFO L899 garLoopResultBuilder]: For program point L1020(lines 1020 1024) no Hoare annotation was computed. [2022-11-20 10:53:17,120 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-11-20 10:53:17,120 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-11-20 10:53:17,121 INFO L899 garLoopResultBuilder]: For program point L1136-1(line 1136) no Hoare annotation was computed. [2022-11-20 10:53:17,121 INFO L899 garLoopResultBuilder]: For program point L1070(lines 1070 1076) no Hoare annotation was computed. [2022-11-20 10:53:17,121 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-11-20 10:53:17,121 INFO L895 garLoopResultBuilder]: At program point L1318(line 1318) 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 .cse3 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse4 .cse5))) [2022-11-20 10:53:17,121 INFO L899 garLoopResultBuilder]: For program point L1318-1(line 1318) no Hoare annotation was computed. [2022-11-20 10:53:17,121 INFO L899 garLoopResultBuilder]: For program point L1219(lines 1219 1227) no Hoare annotation was computed. [2022-11-20 10:53:17,122 INFO L899 garLoopResultBuilder]: For program point L1054(lines 1054 1058) no Hoare annotation was computed. [2022-11-20 10:53:17,122 INFO L895 garLoopResultBuilder]: At program point L1021(line 1021) 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 .cse3 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse4 .cse5))) [2022-11-20 10:53:17,122 INFO L899 garLoopResultBuilder]: For program point L1021-1(line 1021) no Hoare annotation was computed. [2022-11-20 10:53:17,122 INFO L895 garLoopResultBuilder]: At program point L1137(lines 1051 1144) 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-11-20 10:53:17,122 INFO L899 garLoopResultBuilder]: For program point L1104(lines 1104 1108) no Hoare annotation was computed. [2022-11-20 10:53:17,122 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-11-20 10:53:17,123 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1233) no Hoare annotation was computed. [2022-11-20 10:53:17,123 INFO L899 garLoopResultBuilder]: For program point L1451-1(line 1451) no Hoare annotation was computed. [2022-11-20 10:53:17,123 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-11-20 10:53:17,123 INFO L895 garLoopResultBuilder]: At program point L1319(lines 1314 1321) 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 .cse3 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse4 .cse5))) [2022-11-20 10:53:17,123 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-11-20 10:53:17,124 INFO L895 garLoopResultBuilder]: At program point L1121(lines 1111 1125) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-20 10:53:17,124 INFO L899 garLoopResultBuilder]: For program point L1154-1(line 1154) no Hoare annotation was computed. [2022-11-20 10:53:17,124 INFO L899 garLoopResultBuilder]: For program point L1237(line 1237) no Hoare annotation was computed. [2022-11-20 10:53:17,124 INFO L895 garLoopResultBuilder]: At program point L1138(lines 1051 1144) 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-11-20 10:53:17,124 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-11-20 10:53:17,124 INFO L899 garLoopResultBuilder]: For program point L1072-1(line 1072) no Hoare annotation was computed. [2022-11-20 10:53:17,125 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1233) no Hoare annotation was computed. [2022-11-20 10:53:17,125 INFO L902 garLoopResultBuilder]: At program point L1287(lines 1201 1289) the Hoare annotation is: true [2022-11-20 10:53:17,125 INFO L899 garLoopResultBuilder]: For program point L1221(lines 1221 1225) no Hoare annotation was computed. [2022-11-20 10:53:17,125 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 10:53:17,125 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1128) no Hoare annotation was computed. [2022-11-20 10:53:17,125 INFO L902 garLoopResultBuilder]: At program point L1238(line 1238) the Hoare annotation is: true [2022-11-20 10:53:17,125 INFO L899 garLoopResultBuilder]: For program point L1007(lines 1007 1011) no Hoare annotation was computed. [2022-11-20 10:53:17,126 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1128) no Hoare annotation was computed. [2022-11-20 10:53:17,126 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) 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-11-20 10:53:17,126 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2022-11-20 10:53:17,126 INFO L899 garLoopResultBuilder]: For program point L1256(line 1256) no Hoare annotation was computed. [2022-11-20 10:53:17,126 INFO L899 garLoopResultBuilder]: For program point L1223(line 1223) no Hoare annotation was computed. [2022-11-20 10:53:17,126 INFO L899 garLoopResultBuilder]: For program point L1223-1(line 1223) no Hoare annotation was computed. [2022-11-20 10:53:17,127 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-11-20 10:53:17,127 INFO L899 garLoopResultBuilder]: For program point L1273(line 1273) no Hoare annotation was computed. [2022-11-20 10:53:17,127 INFO L895 garLoopResultBuilder]: At program point L1141(lines 1051 1144) 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-11-20 10:53:17,127 INFO L899 garLoopResultBuilder]: For program point L1257(lines 1257 1271) no Hoare annotation was computed. [2022-11-20 10:53:17,127 INFO L899 garLoopResultBuilder]: For program point L1158(line 1158) no Hoare annotation was computed. [2022-11-20 10:53:17,127 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrEXIT(lines 1030 1037) no Hoare annotation was computed. [2022-11-20 10:53:17,127 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_attrENTRY(lines 1030 1037) the Hoare annotation is: true [2022-11-20 10:53:17,128 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrFINAL(lines 1030 1037) no Hoare annotation was computed. [2022-11-20 10:53:17,128 INFO L902 garLoopResultBuilder]: At program point L1033(line 1033) the Hoare annotation is: true [2022-11-20 10:53:17,128 INFO L902 garLoopResultBuilder]: At program point L1033-1(line 1033) the Hoare annotation is: true [2022-11-20 10:53:17,128 INFO L902 garLoopResultBuilder]: At program point IS_ERRENTRY(lines 1298 1305) the Hoare annotation is: true [2022-11-20 10:53:17,128 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 1298 1305) no Hoare annotation was computed. [2022-11-20 10:53:17,128 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 1298 1305) no Hoare annotation was computed. [2022-11-20 10:53:17,128 INFO L902 garLoopResultBuilder]: At program point L1302(line 1302) the Hoare annotation is: true [2022-11-20 10:53:17,129 INFO L899 garLoopResultBuilder]: For program point L1302-1(line 1302) no Hoare annotation was computed. [2022-11-20 10:53:17,132 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:17,134 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:53:17,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:53:17 BoogieIcfgContainer [2022-11-20 10:53:17,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:53:17,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:53:17,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:53:17,175 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:53:17,176 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:52:52" (3/4) ... [2022-11-20 10:53:17,179 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 10:53:17,185 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2022-11-20 10:53:17,185 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2022-11-20 10:53:17,185 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-11-20 10:53:17,186 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-20 10:53:17,186 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2022-11-20 10:53:17,186 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2022-11-20 10:53:17,186 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2022-11-20 10:53:17,186 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-20 10:53:17,186 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-20 10:53:17,186 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-11-20 10:53:17,186 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2022-11-20 10:53:17,187 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-20 10:53:17,187 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2022-11-20 10:53:17,187 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2022-11-20 10:53:17,187 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2022-11-20 10:53:17,206 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2022-11-20 10:53:17,207 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-20 10:53:17,208 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 10:53:17,209 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 10:53:17,209 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:53:17,256 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(ldv_count_2) == 0) || !(0 <= ref_cnt)) || !(ldv_state_variable_1 == 1)) || !(ldv_state_variable_0 == 3)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) [2022-11-20 10:53:17,335 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:53:17,335 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:53:17,337 INFO L158 Benchmark]: Toolchain (without parser) took 26861.73ms. Allocated memory was 151.0MB in the beginning and 436.2MB in the end (delta: 285.2MB). Free memory was 117.4MB in the beginning and 313.3MB in the end (delta: -195.9MB). Peak memory consumption was 89.7MB. Max. memory is 16.1GB. [2022-11-20 10:53:17,337 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory was 94.9MB in the beginning and 94.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:53:17,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 725.09ms. Allocated memory is still 151.0MB. Free memory was 117.0MB in the beginning and 87.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-20 10:53:17,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.45ms. Allocated memory is still 151.0MB. Free memory was 87.6MB in the beginning and 83.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:53:17,339 INFO L158 Benchmark]: Boogie Preprocessor took 78.23ms. Allocated memory is still 151.0MB. Free memory was 83.5MB in the beginning and 79.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:53:17,339 INFO L158 Benchmark]: RCFGBuilder took 1197.11ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 79.6MB in the beginning and 139.4MB in the end (delta: -59.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-11-20 10:53:17,339 INFO L158 Benchmark]: TraceAbstraction took 24619.50ms. Allocated memory was 209.7MB in the beginning and 436.2MB in the end (delta: 226.5MB). Free memory was 138.4MB in the beginning and 323.8MB in the end (delta: -185.4MB). Peak memory consumption was 231.9MB. Max. memory is 16.1GB. [2022-11-20 10:53:17,340 INFO L158 Benchmark]: Witness Printer took 160.56ms. Allocated memory is still 436.2MB. Free memory was 323.8MB in the beginning and 313.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 10:53:17,344 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.20ms. Allocated memory is still 151.0MB. Free memory was 94.9MB in the beginning and 94.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 725.09ms. Allocated memory is still 151.0MB. Free memory was 117.0MB in the beginning and 87.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.45ms. Allocated memory is still 151.0MB. Free memory was 87.6MB in the beginning and 83.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.23ms. Allocated memory is still 151.0MB. Free memory was 83.5MB in the beginning and 79.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1197.11ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 79.6MB in the beginning and 139.4MB in the end (delta: -59.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 24619.50ms. Allocated memory was 209.7MB in the beginning and 436.2MB in the end (delta: 226.5MB). Free memory was 138.4MB in the beginning and 323.8MB in the end (delta: -185.4MB). Peak memory consumption was 231.9MB. Max. memory is 16.1GB. * Witness Printer took 160.56ms. Allocated memory is still 436.2MB. Free memory was 323.8MB in the beginning and 313.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * 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, 210 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 24.5s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5632 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5233 mSDsluCounter, 12139 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7605 mSDsCounter, 1325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4467 IncrementalHoareTripleChecker+Invalid, 5792 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1325 mSolverCounterUnsat, 4534 mSDtfsCounter, 4467 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1456 GetRequests, 1366 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=946occurred in iteration=9, 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.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 2819 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 1151 PreInvPairs, 1267 NumberOfFragments, 1532 HoareAnnotationTreeSize, 1151 FomulaSimplifications, 16182 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 84 FomulaSimplificationsInter, 16577 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2285 NumberOfCodeBlocks, 2285 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2582 ConstructedInterpolants, 0 QuantifiedInterpolants, 5016 SizeOfPredicates, 2 NumberOfNonLiveVariables, 5484 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 27 InterpolantComputations, 14 PerfectInterpolantSequences, 815/875 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 && 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 && ref_cnt <= 0) && 0 <= i) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && i < 2147483646) && 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) && ldv_state_variable_1 == 1) && 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: (((ldv_count_1 <= 0 && (((ldv_state_variable_1 == 1 && 1 <= i) && i < 2147483646) || (i == 0 && ldv_state_variable_1 == 1))) && ref_cnt == 0) && ldv_count_2 == 0) && 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 && 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) && ldv_state_variable_1 == 1) && 1 <= i) && i < 2147483646) && 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: 1000]: 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) && ldv_state_variable_1 == 1) && 1 <= i) && i < 2147483646) && 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 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && 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 && 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) && ldv_state_variable_1 == 1) && 1 <= i) && i < 2147483646) && 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 && 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) && ldv_state_variable_1 == 1) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1013]: 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) && ldv_state_variable_1 == 1) && 1 <= i) && 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) && i <= 0 - InvariantResult [Line: 1051]: 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: ((((ldv_count_1 <= 0 && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0) || (((((ldv_count_1 <= 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 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - 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 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && 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 && 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) && ldv_state_variable_1 == 1) && 1 <= i) && i < 2147483646) && 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: (((((!(\old(ldv_count_2) == 0) || !(0 <= ref_cnt)) || !(ldv_state_variable_1 == 1)) || !(ldv_state_variable_0 == 3)) || ldv_count_2 == 0) || !(ref_cnt <= 0)) || !(ldv_count_1 <= 0) RESULT: Ultimate proved your program to be correct! [2022-11-20 10:53:17,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a0e4be-a961-4302-adef-50dc22977579/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE